Solving Checkers
- Jonathan Schaeffer, Department of Computing Science, University of Alberta
- Yngvi Bjornsson, School of Computer Science, Reykjavik University, Iceland
- Neil Burch, Department of Computing Science, University of Alberta
- Akihiro Kishimoto
- Martin Mueller
- Robert Lake
- Paul Lu, Department of Computing Science
- Steve Sutphen
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 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 10^20 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.
Citation
J. Schaeffer, Y. Bjornsson, N. Burch, A. Kishimoto, M. Mueller, R. Lake, P. Lu, S. Sutphen. "Solving Checkers". International Joint Conference on Artificial Intelligence (IJCAI), Edinburgh, Scotland, pp 292-297, January 2005.| Keywords: | machine learning |
| Category: | In Conference |
BibTeX
@incollection{Schaeffer+al:IJCAI05,
author = {Jonathan Schaeffer and Yngvi Bjornsson and Neil Burch and Akihiro
Kishimoto and Martin Mueller and Robert Lake and Paul Lu and Steve Sutphen},
title = {Solving Checkers},
Pages = {292-297},
booktitle = {International Joint Conference on Artificial Intelligence
(IJCAI)},
year = 2005,
}Last Updated: April 24, 2007Submitted by Christian Smith
