Published 26 October, 2020; last updated 08 March, 2021
AI progress in English draughts performance crossed the following ranges in the following times:
Range | Start | End | Duration (years) |
First attempt to beginner level | 1951 | ~1956, <1961 | ~4, <10 |
Beginner to superhuman | ~1956, <1961 | 1994 | ~38, >33 |
Above superhuman | 1994 | 2007* | 13* |
‘English Draughts’ is a popular variety of draughts, or checkers.
Here we look at direct success of AI in beating human players, rather than measuring humans and AI on a separate metric of strength.
Data here comes mostly from Wikipedia. We found several discrepancies in Wikipedia’s accounts of these events, so consider the remaining data to be somewhat unreliable.
According to Wikipedia, the first checkers program was run in 1951.1
There seems to be some ambiguity around the timing and performance of Arthur Samuel’s early draughts programs, but it appears that he worked on them from around 1952. In 1956, he demonstrated a program on television. 2 It is unclear how good the program’s play was, but it is said to have resulted in a fifteen-point rise in the stock price of IBM when demonstrated to IBM shareholders, seemingly at around that time. This weakly suggests that the program played at at least beginner level.
In 1962 Samuel’s program apparently beat an ambiguously skilled player who would by four-years later become a state champion in Connecticut.3 Thus progress was definitely beyond beginner level by 1962.
In 1994, computer program Chinook drew six times against world champion Marius Tinsley, before Tinsley withdrew due to pancreatic cancer and Chinook officially won.4 Thus Chinook appears to have been close to as good as the best player in 1994.
In 2007 checkers was ‘weakly solved’, which is to say that perfect play guaranteeing a draw for both sides from the start of the game is known, from the starting state5 (this does not imply that if someone plays imperfectly, perfect moves following this are known).6 This is not the best possible performance by all measures, since further progress could presumably be made on reliably beating worse players.
Given the above dates, we have:
Range | Start | End | Duration (years) |
First attempt to beginner level | 1951 | ~1956, <1961 | ~4, <10 |
Beginner to superhuman | ~1956, <1961 | 1994 | ~38, >33 |
Above superhuman | 1994 | 2007* | 13* |
Primary author: Katja Grace
“English Draughts.” In Wikipedia, October 8, 2020. https://en.wikipedia.org/w/index.php?title=English_draughts&oldid=982525532.
Schaeffer, Jonathan. One Jump Ahead: Challenging Human Supremacy in Checkers. 1st Edition. New York: Springer, 1997.
quoted in:
“Legacy – Chinook – World Man-Machine Checkers Champion.” Accessed October 26, 2020. http://webdocs.cs.ualberta.ca/~chinook/project/legacy.html.
Although a self-proclaimed master, Nealey’s tournament results never justified such a claim. At the time of the game, he was not a former Connecticut state champion, although he did win the title in 1966, four years after the game with Samuel’s program. In the history of the state championship, no recognized master had won the event. Nealey didn’t play in any of the premier checkers events, such as the U.S. championship, and apparently acquired his reputation by beating local players.”
Schaeffer, Jonathan. One Jump Ahead: Challenging Human Supremacy in Checkers. 1st Edition. New York: Springer, 1997.
quoted in:
“Legacy – Chinook – World Man-Machine Checkers Champion.” Accessed October 26, 2020. http://webdocs.cs.ualberta.ca/~chinook/project/legacy.html.
“Chinook (Computer Program).” In Wikipedia, August 24, 2020. https://en.wikipedia.org/w/index.php?title=Chinook_(computer_program)&oldid=974711515.
“Draughts.” In Wikipedia, October 25, 2020. https://en.wikipedia.org/w/index.php?title=Draughts&oldid=985336948.
“Solved Game.” In Wikipedia, September 11, 2020. https://en.wikipedia.org/w/index.php?title=Solved_game&oldid=977794097.