Partial Information Endgame Databases

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.

• Type: Conference
• Year: 2006
• Where: ACG
• Authors: Yngvi Björnsson, Jonathan Schaeffer, Nathan R. Sturtevant
• Keywords: ACG 2006, Computer Graphics, Endgame Databases, Endgame Positions, Larger Databases