News of the WeekComputer Science

Program Proves That Checkers, Perfectly Played, Is a No-Win Situation

See allHide authors and affiliations

Science  20 Jul 2007:
Vol. 317, Issue 5836, pp. 308-309
DOI: 10.1126/science.317.5836.308a

You are currently viewing the summary.

View Full Text

Log in to view the full text

Log in through your institution

Log in through your institution


If two players face off at checkers and neither makes a wrong move, then the game will inevitably end in a draw. That's the result of a proof executed by hundreds of computers over nearly 2 decades and reported online by Science this week (