论文信息 - A Study of Forward Versus Backwards Endgame Solvers with Results in Chinese Checkers

A Study of Forward Versus Backwards Endgame Solvers with Results in Chinese Checkers

When writing an endgame solver that uses retrograde analysis, there are many significant choices that can be made about how to implement the solver. While significant work has been done on building solvers for many games, including Chess and Checkers, we were surprised to find that there has not been a comprehensive study identifying the choice of solver enhancements. This paper represents preliminary work in this direction, exploring several types of forward and backwards solvers, and reporting preliminary results on small versions of Chinese Checkers.

Nathan R. Sturtevant | Abdallah Saffidine

[1] Jonathan Schaeffer,et al. Building the Checkers 10-piece Endgame Databases , 2003, ACG.

[2] Ken Thompson,et al. Retrograde Analysis of Certain Endgames , 1986, J. Int. Comput. Games Assoc..

[3] Richard E. Korf,et al. Best-First Frontier Search with Delayed Duplicate Detection , 2004, AAAI.

[4] Guy Haworth,et al. Space-Efficient Indexing of Chess Endgame Tables , 2000, J. Int. Comput. Games Assoc..

[5] Nathan R. Sturtevant,et al. Minimizing Writes in Parallel External Memory Search , 2013, IJCAI.

[6] Nathan R. Sturtevant,et al. Partial Information Endgame Databases , 2006, ACG.

[7] Nathan R. Sturtevant,et al. Optimal solutions for moving target search , 2009, AAMAS.

[8] Eric A. Hansen,et al. Parallel Structured Duplicate Detection , 2007, AAAI.

[9] Guy Haworth,et al. Space-efficient indexing of endgame tables for chess , 2001 .