Abstract
In 1993, the Chinook team completed the computation of the 2 through 8-piece checkers endgame databases, consisting of roughly 444 billion positions. Until recently, nobody had attempted to extend this work. In November 2001, we began an effort to compute the 9- and 10-piece databases. By June 2003, the entire 9-piece database and the 5-piece versus 5-piece portion of the 10-piece database were completed. The result is a 13 trillion position database, compressed into 148 GB of data organized for real-time decompression. This represents the largest endgame database initiative yet attempted. The results obtained from these computations are being used to aid an attempt to weakly solve the game. This paper describes our experiences working on building large endgame databases.
Chapter PDF
Similar content being viewed by others
References
Allis, L. (1994). Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Department of Computing Science, Universiteit Maastricht, Maastricht, The Netherlands. Dodgen, G. and Trice, E. (2002). Personal communication.
Gasser, R. (1996). Solving Nine Men’s Morris. Computational Intelligence, 12: 24–41.
Goldenberg, M., Lu, P., Pinchack, C., and Schaeffer, J. (2003). TrellisDAG: A System for Structured DAG Scheduling. In 9th Workshop on Job Scheduling Strategies for Parallel Processing, pages 21–34. Springer-Verlag.
Lake, R., Schaeffer, J., and Lu, P. (1994). Solving large retrograde analysis problems using a network of workstations. In van den Herik, H., Herschberg, I., and Uiterwijk, J., editors, Advances in Computer Chess 7, pages 135–162. University of Limburg, Maastricht, The Netherlands.
Lincke, T. and Marzetta, A. (2000). Large endgame databases with limited memory space. ICGA Journal, 23 (3): 131–138.
Romein, J. and Bal, H. (2002). Awari is solved. ICGA Journal, 25 (3): 162–165.
Romein, J. and Bal, H. (2003). Solving the game of awari using parallel rétrograde analysis. IEEE Computer. To appear.
Schaeffer, J. (1997). One Jump Ahead: Challenging Human Supremacy in Checkers. Springer-Verlag.
Trice, E. and Dodgen, G. (2003). The 7-piece perfect play lookup database for the game of checkers. In van den Herik, H., Iida, H., and Heinz, E., editors, Advances in Computer Games 10, pages 211–230. Kluwer Academic Publishers, Norwell, MA.
Turpin, A. and Moffat, A. (1995). Practical length-limited coding for large alphabets. The Computer Journal, 38 (5): 339–347.
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
Schaeffer, J., Björnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S. (2004). Building the Checkers 10-Piece Endgame Databases. 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_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-35706-5_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4424-8
Online ISBN: 978-0-387-35706-5
eBook Packages: Springer Book Archive