Building the Checkers 10-piece Endgame Databases
- 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
- Robert Lake
- Paul Lu, Department of Computing Science
- Steve Sutphen
In 1993, the CHINOOK team completed the computation of the 2 through 8-piece checkers endgame databases, consisting of roughly 444 billion positions. Untill 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 verses 5-piece portion of the 10-piece database were completed. The result is a 13 trillion position decompression. This represents the largest endgame database intitiative 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.
Citation
J. Schaeffer, Y. Bjornsson, N. Burch, R. Lake, P. Lu, S. Sutphen. "Building the Checkers 10-piece Endgame Databases". Advances in Computer Games (ACG), (ed: Kluwer Academic Publishers), pp 193-210, January 2003.| Keywords: | machine learning |
| Category: | In Conference |
BibTeX
@incollection{Schaeffer+al:ACG03,
author = {Jonathan Schaeffer and Yngvi Bjornsson and Neil Burch and Robert
Lake and Paul Lu and Steve Sutphen},
title = {Building the Checkers 10-piece Endgame Databases},
Editor = {Kluwer Academic Publishers},
Pages = {193-210},
booktitle = {Advances in Computer Games (ACG)},
year = 2003,
}Last Updated: March 07, 2007Submitted by AICML Admin Assistant
