Checkers Is Solved

By Jonathan Schaeffer, Neil Burch, Yngvi Björnsson, Akihiro Kishimoto, Martin Müller, R. Lake, Paul Lu, Steve Sutphen. 2007

501 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Developmental and Educational Psychology, Sociology and Political Science, Game & Decision Theory

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Developmental and Educational Psychology

In Sociology and Political Science

In Game & Decision Theory

Citations in the corpus

State of the Art Control of Atari Games Using Shallow Reinforcement Learning (2015, background): “Games have always been an important testbed for AI, frequently being used to demonstrate major contributions to the field [5, 6, 8, 23, 28].”
Sidekick agents for sequential planning problems (2013, methodology): “An extreme case is checkers, which has been solved via a combination of minimax search and an exhaustive lookup table of end game positions [55].”
Machine behaviour (2019, background): “Excellent progress has been made on benchmark tasks, from board games like Chess 68 , Checkers 69 , and Go 70,71 to card games like Poker 72 , to computer games like those on the Atari platform 73 , to artificial markets 74 , to Robocup Soccer 75 , as well as standardized evaluation data such…”
Safe and Nested Endgame Solving for Imperfect-Information Games (2017, background): “In fact, in checkers it is so powerful that it was used to solve the entire game (Schaeffer et al. 2007).”
Measuring universal intelligence: Towards an anytime intelligence test (2010, background): “, to play optimally, as was recently done in [46] with checkers), and it is a different thing to simply learn the rules of play.”
Cooperating with machines (2017, unknown): “While the majority of AI milestones have focused on developing humanlevel wherewithal to compete with people [6, 7, 8, 9, 10], most scenarios in which AI must interact with people and other machines are not zero-sum interactions.”
Evaluation in artificial intelligence: from task-oriented to ability-oriented measurement (2017, background): “For instance, in board games, algorithms can be derived and analysed whether they are optimal, such as noughts and crosses (tic-tac-toe) and English draughts (checkers), the latter solved by Jonathan Schaeffer (Schaeffer et al, 2007).”
Solving Imperfect Information Games Using Decomposition (2013, background): “For example, checkers with 5× 10(20) states has been solved (Schaeffer et al. 2007) both in terms of the game’s value and an optimal Nash equilibrium strategy.”