Partial Information Endgame Databases
- Cite this paper as:
- Björnsson Y., Schaeffer J., Sturtevant N.R. (2006) Partial Information Endgame Databases. In: van den Herik H.J., Hsu SC., Hsu T., Donkers H.H.L.M.. (eds) Advances in Computer Games. ACG 2005. Lecture Notes in Computer Science, vol 4250. Springer, Berlin, Heidelberg
Endgame databases have previously been built based on complete analysis of endgame positions. In the domain of Checkers, where endgame databases consisting of 39 trillion positions have already been built, it would be beneficial to be able to build select portions of even larger databases, without fully computing portions of the database that will almost never be needed. We present a new win-loss-draw value algorithm that can build endgame databases when unknown (partial information) values are present, showing that significant portions of these databases can be resolved using these methods.
Unable to display preview. Download preview PDF.