Loading field map
The strategic history of checkers (draughts) is defined by a pursuit of definitive knowledge within a finite, though vast, game tree. Its central question evolved from discovering winning lines to managing complexity and, ultimately, to the computational resolution of the game under perfect play. This journey saw distinct strategic paradigms emerge, each characterized by a core philosophy for handling the board’s tension between material, position, and tempo.
The foundational era established the game’s Classical Tactical School. Play was governed by direct attacks, straightforward exchanges, and the immediate pursuit of a material advantage. Strategy was largely heuristic, focused on basic kingings and avoiding obvious blunders. This period produced the first published treatises and established the game’s fundamental rules and piece movements as the bedrock for all later analysis.
A major transition occurred with the rise of the Scientific Positional School in the 19th and early 20th centuries. Pioneered by masters like James Wyllie and Andrew Anderson, this paradigm shifted focus from crude tactics to long-term structural advantages. Key principles involved the creation and exploitation of "weak" squares, the strategic sacrifice of material for positional compensation (the "go-as-you-please" philosophy), and the meticulous building of strong, flexible formations. This school treated checkers as a positional battle akin to chess, emphasizing control of the center and the creation of enduring binds.
The Two-Move Restriction (1900) and later the Three-Move Restriction (1934) were not mere rule changes but profound methodological catalysts. By limiting opening moves to a prescribed ballot, they forced theory to deepen exponentially within defined channels. This gave birth to the era of Restriction-Book Analysis. The paradigm became one of exhaustive memorization and published analysis of specific ballot lines, with masters like Newell Banks and Tom Wiswell compiling volumes of "book" moves. Strategy was now bifurcated: deep theoretical knowledge of published lines and the skill to navigate the resulting mid-game positions where "book" ended.
This analytical depth spurred the Modern Endgame Database paradigm. The mid-to-late 20th century saw a concerted effort to solve endgame configurations definitively. The work of Richard Fortman and others in cataloging all 2-piece vs. 1-piece, 3 vs. 2, and more complex endgames shifted strategic understanding. Knowing a position was a theoretical win, loss, or draw transformed endgame play from technique into execution of a known database result, profoundly influencing mid-game decisions.
The final, definitive transition was the advent of Computer Exhaustive Analysis. Beginning with the checkers program CHINOOK in the 1990s, led by Jonathan Schaeffer, this paradigm leveraged brute-force computational search and endgame databases. It moved beyond human-centric "schools of thought" to a methodological phase of machine verification. This culminated in the Perfect Play Resolution of the game, announced in 2007, which proved that from the standard starting position, checkers is a theoretical draw with perfect play. This resolved the game’s central strategic question.
The current landscape is post-solution. The dominant framework is Engine-Verified Theory. All opening ballots under the three-move restriction have been analyzed to a conclusion, creating a comprehensive, machine-generated map of the game. Human competition now exists within this fully charted territory, focusing on practical play, trap-setting in known lines, and endurance in navigating the vast draw trees. The rivalries of old strategic schools have been supplanted by the utilization of and deviation from engine-published perfect play.
Thus, checkers strategy evolved from heuristic tactics through deep positional science and restrictive-book analysis to endgame database theory, culminating in a complete computational solution. The historical paradigms—Classical Tactical, Scientific Positional, Restriction-Book Analysis, Modern Endgame Database, and Computer Exhaustive Analysis—chart this path from art to exhaustive science.