Solving checkers

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 292-297

  Schaeffer, J ^a   Bjornsson Y ^a   Burch, N ^a   Kishimoto, A ^a   Muller M ^a   Lake, R ^a   Lu, P ^a   Sutphen, S ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GAME-PLAYING PROGRAMS; GAME-THEORETIC; HUMAN PLAYERS; IN-BUILDINGS; SEARCH SPACES;

ARTIFICIAL INTELLIGENCE;

EID: 84880710441     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. V. Allis, J. van den Herik, and I. Herschberg. Which games will survive. In Heuristic Programming in Artificial Intelligence 2, pages 232-243. Ellis Horwood Limited, 1991.
2. V. Allis. A knowledge-based approach to Connect-Four. The game is solved: White wins. Master's thesis, Vrije Universiteit, Amsterdam, 1988.
3. V. Allis. Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Department of Computer Science, University of Limburg, 1994.
4. Chinook, 1995. http://www.cs.ualberta.ca/∼chinook/databases/total. php.
5. R. Fortman. Basic checkers, 1977. Privately published, but online at http://home.clara.net/davey/basicche.html.
6. R. Gasser. Solving Nine Men's Morris. Computational Intelligence, 12:24-41, 1996.
7. E. Gilbert, 2005. http://pages.prodigy.net/eyg/Checkers.
8. A. Kishimoto and M. Müller. Df-pn in Go: Application to the one-eye problem. In van den Herik et al. [2003], pages 125-141.
9. A. Kishimoto and M. Müller. A general solution to the graph history interaction problem. In AAAI, pages 644-649, 2004.
10. D. McAllester. Conspiracy numbers for min-max search. Artificial Intelligence, 35:287-310, 1988.
11. A. Nagai. Df-pn Algorithm for Searching AND/OR Trees and Its Applications. PhD thesis, Department of Information Science, University of Tokyo, 2002.
12. J. Romein and H. Bal. Solving the game of awari using parallel retrograde analysis. IEEE Computer, 36(10):26-33, 2003.
13. J. Schaeffer, Y. Björnsson, N. Burch, R. Lake, P. Lu, and S. Sutphen. Building the checkers 10-piece endgame databases. In van den Herik et al. [2003], pages 193-210.
14. J. Schaeffer. One Jump Ahead. Springer-Verlag, 1997.
15. K. Thompson. Retrograde analysis of certain endgames. Journal of the International Computer Chess Association, 9(3):131-139, 1986.
16. E. Trice and G. Dodgen. The 7-piece perfect play lookup database for the game of checkers. In van den Herik et al. [2003], pages 211-230.
17. J. van den Herik, H. Iida, and E. Heinz, editors. Advances in Computer Games 10. Kluwer Academic Publishers, 2003.