Solving Checkers
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 292-296.
Abstract
AI has had notable success in building highperformance game-playing programs to compete against the best human players. However, the availability of fast and plentiful machines with large memories and disks creates the possibility of 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 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.
@inproceedings{ijcai2005p32,
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 = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {292--296},
year = {2005},
url = {https://ijcai.org/proceedings/2005/32},
}
TY - CPAPER TI - Solving Checkers AU - Schaeffer, Jonathan AU - Björnsson, Yngvi AU - Burch, Neil AU - Kishimoto, Akihiro AU - Müller, Martin AU - Lake, Robert AU - Lu, Paul AU - Sutphen, Steve T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 292 EP - 296 UR - https://ijcai.org/proceedings/2005/32 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: