Abstract
Many research teams and individuals have computed endgame databases for the game of chess which use the distance-to-mate metric, enabling their software to forecast the number of moves remaining until the game is over. This is not the case for the game of checkers. Only one programming team has generated a checkers database capable of announcing the distance to the terminal position. This paper examines the benefits and detriments associated with computing three different types of checkers endgames databases, demonstrates the solutions to the longest wins in the 7-piece checkers database, presents tables of longest wins for positions including all permutations of four pieces and fewer against three pieces and fewer, and offers major improvements to some previously published play.
Chapter PDF
References
Cash, M. and Miller, G. (2002). Checkers Solutions Bulletin Board Service, November 26. Since both MTC and PPL databases had been computed, G. Miller was offering a prize for the longest win found under the constraint that a Checker is unmoved for the duration.
Dodgen, G. and Trice, E. (2001). Co-authors of the WORLD CHAMPIONSHIP CHECKERS (WCC) program. An earlier, weaker version of the program (CHECKERS EXPERIMENTAL) was rated sixth in the world in 1992 (Schaeffer, 1997, p. 250), behind Dr. Marion Tinsley at number one, and the CHINOOK program at number two. See for more information about the current version of the program: http://www.WorldChampionshipCheckers.com.
Gibson, J.R. (1993). No Respect: A Short History of Computer Checkers. The Keystone Checker Review, January, pp. 476–477.
Gilbert, E. (2002). KINGSROw checkers programmer. KINGSRow is currently ranked as the second strongest program in the world by virtue of placing second at the World Computer Checkers Championship held in Las Vegas, August 3–9, 2002.
Lake, R., Schaeffer, J., and Lu, P. (1994). Solving Large Retrograde Analysis Problems Using a Network of Workstations. Advances in Computer Chess 7, (eds. H.J. van den Herik, I.S. Herschberg, J.W.H.M. Uiterwijk), pp. 136–162. University of Limburg, Maastricht, The Netherlands.
Payne, W. (1756). Introduction to the Game of Draughts.
Schaeffer, J. (1997). One Jump Ahead: Challenging Human Supremacy in Checkers. Springer-Verlag, New York, NY.
Schaeffer, J. and Lake, R. (1996). Solving the Game of Checkers. Games of No Chance, (ed. R.J. Nowakowski), MSRI Publications, Volume 29, pp. 119–133. Cambridge University Press.
Schaeffer, J., Lake, R., Lu, P., and Bryant, M. (1996). Chinook: The World Man-Machine Checkers Champion. AI Magazine, Vol. 17, No. 1, pp. 21–19.
Sturges, J. (1800). Guide to the Game of Draughts,London.
Waldteufel, R. (2002). WYLLIE checkers programmer. July 21–27, 2002, Stonehaven, Scotland. WYLLIE defeated ACF 3-move World Champion Alex Moiseyev by the score of 16 wins, 3 losses, and 49 draws. Alex Moiseyev was also playing in the 2002 British Open tournament, where he finished in second place.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Trice, E., Dodgen, G. (2004). The 7-Piece Perfect Play Lookup Database for the Game of Checkers. In: Van Den Herik, H.J., Iida, H., Heinz, E.A. (eds) Advances in Computer Games. IFIP — The International Federation for Information Processing, vol 135. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35706-5_14
Download citation
DOI: https://doi.org/10.1007/978-0-387-35706-5_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4424-8
Online ISBN: 978-0-387-35706-5
eBook Packages: Springer Book Archive