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

Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 818)

Abstract

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.

References

  1. 1.
    Björnsson, Y., Schaeffer, J., Sturtevant, N.R.: Partial information endgame databases. In: van den Herik, H.J., Hsu, S.-C., Hsu, T., Donkers, H.H.L.M.J. (eds.) ACG 2005. LNCS, vol. 4250, pp. 11–22. Springer, Heidelberg (2006).  https://doi.org/10.1007/11922155_2 CrossRefGoogle Scholar
  2. 2.
    Buro, M., Long, J.R., Furtak, T., Sturtevant, N.R.: Improving state evaluation, inference, and search in trick-based card games. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009, Pasadena, California, USA, 11–17 July 2009, pp. 1407–1413 (2009)Google Scholar
  3. 3.
    Korf, R.E.: Best-first frontier search with delayed duplicate detection. In: McGuinness, D.L., Ferguson, G. (eds.) Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence (AAAI), pp. 650–657. AAAI Press/The MIT Press, San Jose (2004)Google Scholar
  4. 4.
    Moldenhauer, C., Sturtevant, N.: Optimal solutions for moving target search. In: Autonomous Agents and Multiagent Systems (AAMAS), pp. 1249–1250. International Foundation for Autonomous Agents and Multiagent Systems (2009)Google Scholar
  5. 5.
    Nalimov, E., Haworth, G.M., Heinz, E.A.: Space-efficient indexing of endgame tables for chess. ICGA J. 23(3), 148–162 (2000)CrossRefGoogle Scholar
  6. 6.
    Schaeffer, J., Björnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S.: Building the checkers 10-piece endgame databases. Adv. Comput. Games 10, 193–210 (2003)Google Scholar
  7. 7.
    Sturtevant, N., Rutherford, M.: Minimizing writes in parallel external memory search. In: International Joint Conference on Artificial Intelligence (IJCAI) (2013)Google Scholar
  8. 8.
    Thompson, K.: Retrograde analysis of certain endgames. ICCA J. 9(3), 131–139 (1986)MathSciNetGoogle Scholar
  9. 9.
    Zhou, R., Hansen, E.A.: Parallel structured duplicate detection. In: Twenty-Second AAAI Conference on Artificial Intelligence (AAAI), pp. 1217–1224. AAAI Press, Vancouver (2007)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of DenverDenverUSA
  2. 2.School of Computer Science and EngineeringUniversity of New South WalesSydneyAustralia

Personalised recommendations