Perfect play makes checkers a draw
The 2007 result was a weak solution: computer scientists proved that, from the standard starting position, neither player can force a win if both play perfectly. The game’s value is a draw. That does not mean every checkers game ends tied; it means each player has a strategy that can prevent a loss against any opponent strategy.
The distinction matters because “solved” can mean different things. A complete solution would determine the result of every legal position. The checkers result answers the narrower question that matters most to a match: what can happen when play begins from the usual opening setup?
How the proof was built
The project, led by computer scientist Jonathan Schaeffer, used Chinook, a checkers-playing program. The team combined searching through possible moves with stored results for positions near the end of a game. Searching every possible game from start to finish would be impractical, so the program used these endgame records to settle branches of the search without replaying every continuation in full.
A search tree is the branching set of possible move sequences: each move creates new positions, and each position can lead to more. By analyzing enough of that tree and checking that the remaining possibilities could not overturn the result, the researchers established that a player could always hold the game to a draw with perfect decisions.
What the result does—and doesn’t—say
It does not make ordinary games predictable. Players make mistakes, and a single bad move can give an opponent a winning route. Nor does the proof tell a human the best move in every situation at a glance; it establishes the outcome mathematically, with computation doing the exhaustive work.
The striking consequence is that checkers’ opening position has no forced winner. A champion can still outplay an opponent, but against flawless play, the best either side can secure is to avoid losing.
