Checkers – Chessprogramming wiki
Home * Games * Checkers
Checkers,
also American Checkers or English draughts, is a variant of Draughts played on an eight by eight board using 32 either dark or light squares. Like Chess, Checkers is a two-player zero-sum and perfect information abstract strategy board game.
Rules
Each side starts with twelve checkers, placed on the three back-ranks. Black moves first, alternating with White – there is no passing move. Checkers move one step diagonally forward, kings diagonally forward and backward. When a checker reaches the last rank, it promotes to a king. Checkers and king capture men by jumping over them to an empty square behind (checkers only forward). Captures are compulsory, one must play a capture if at least one is available, and is required to continue jumping and capturing as part of the same turn. However, a checker reaching the last row must stop to be crowned and can move no further on that turn [2]. The side run out of moves loses.
Solving Checkers
In 2007, the Chinook team around Jonathan Schaeffer declared Checkers solved [3] [4] [5].
Programs
The first Checkers program was written by Christopher Strachey, National Research Development Corporation, London, in the early 1950s to run on a Pilot ACE at the National Physical Laboratory, exhausting its memory [6], and soon ported to the Ferranti Mark 1 [7] [8]. His checkers program from 1966 [9] written in CPL is available on-line, in a corrected version with courtesy of Peter Norvig [10] [11]. The second program was written in 1956 by Arthur Samuel [12]:
American checkers
Classical checkers
See also
Selected Publications
1952 …
1960 …
1970 …
1980 …
1990 …
1995 …
2000 …
2005 …
2010 …
2015 …
2020 …
- Bill Jordan (2021). How to Write a Checkers Program. amazon [18]
Forum Posts
1990 …
2000 …
2010 …
2020 …
References
Up one Level