ML Anthology

Solving Checkers

Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen
IJCAI 2005 pp. 292-297
/ijcai/2005/schaeffer2005ijcai-solving/

Abstract

AI has had notable success in building high-performance game-playing programs to complete against the best human players. However, the availability of fast and plentiful machines with large memories and disks creates the possibility of solving a game. This has been done before for simple or relatively small games. In this paper, we present new ideas and algorithms for solving the game of checkers. Checkers is a popular game of skill with a search space of 1020 possible positions. This paper reports on our first result. One of the most challenging checkers openings has been solved-the White Doctor opening is a draw. Solving roughly 50 more openings will result in the game-theoretic value of checkers being determined.

PDF Semantic Scholar

Cite

Text

Schaeffer et al. "Solving Checkers." International Joint Conference on Artificial Intelligence, 2005.

Markdown

[Schaeffer et al. "Solving Checkers." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/schaeffer2005ijcai-solving/)

BibTeX

@inproceedings{schaeffer2005ijcai-solving,
  title     = {{Solving Checkers}},
  author    = {Schaeffer, Jonathan and Björnsson, Yngvi and Burch, Neil and Kishimoto, Akihiro and Müller, Martin and Lake, Robert and Lu, Paul and Sutphen, Steve},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {292-297},
  url       = {https://mlanthology.org/ijcai/2005/schaeffer2005ijcai-solving/}
}