How Chinook Turned Checkers Into a Solved Game
A checkers position can branch into many possible futures: each legal move leads to another position, with more choices after that. Chinook, a computer program developed by a research team, tackled this explosion by combining two tools: searching through possible moves and storing the outcomes of endgames in large databases.
An endgame database is a catalog of positions with only a few pieces left, together with the result of perfect play from each one. When a search reaches a position in the catalog, the program does not have to explore every continuation from scratch. It can use the stored result to judge that branch and work backward toward earlier positions.
What “Perfect Play” Means
For each position, a player can choose a move that preserves the best available outcome. If one side has a move that guarantees a win no matter how the opponent responds, that side can force a win. The 2007 result showed that, from the standard opening position, neither player has such a winning strategy: with optimal choices by both sides, the result is a draw.
That does not mean every game ends peacefully, or that players must repeat the same sequence. Many moves may still be playable, and a single mistake can turn a drawn position into a loss. Chinook’s result concerns the best possible play, not the most common play.
Why the Result Matters at the Board
The proof changes the question from “Can checkers be won?” to “Can a player avoid losing?” Against an opponent who also plays perfectly, the answer from the standard start is yes. Against a human opponent, the game remains a contest of recognizing threats, choosing sound moves, and waiting for the other player to slip. A draw in the mathematical solution is therefore not a promise about ordinary games; it is the outcome that survives when neither side makes a mistake.
