Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Computer Games (CGW 2017)

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

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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

    Chapter  Google Scholar 

  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. 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. 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. Nalimov, E., Haworth, G.M., Heinz, E.A.: Space-efficient indexing of endgame tables for chess. ICGA J. 23(3), 148–162 (2000)

    Article  Google Scholar 

  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. Sturtevant, N., Rutherford, M.: Minimizing writes in parallel external memory search. In: International Joint Conference on Artificial Intelligence (IJCAI) (2013)

    Google Scholar 

  8. Thompson, K.: Retrograde analysis of certain endgames. ICCA J. 9(3), 131–139 (1986)

    MathSciNet  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Denver, Denver, CO, USA

    Nathan R. Sturtevant

  2. School of Computer Science and Engineering, University of New South Wales, Sydney, Australia

    Abdallah Saffidine

Authors
  1. Nathan R. Sturtevant
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdallah Saffidine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nathan R. Sturtevant .

Editor information

Editors and Affiliations

  1. Université Paris-Dauphine, Paris, France

    Tristan Cazenave

  2. Maastricht University, Maastricht, The Netherlands

    Mark H.M. Winands

  3. The University of New South Wales, Sydney, New South Wales, Australia

    Abdallah Saffidine

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sturtevant, N.R., Saffidine, A. (2018). A Study of Forward Versus Backwards Endgame Solvers with Results in Chinese Checkers. In: Cazenave, T., Winands, M., Saffidine, A. (eds) Computer Games. CGW 2017. Communications in Computer and Information Science, vol 818. Springer, Cham. https://doi.org/10.1007/978-3-319-75931-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75931-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75930-2

  • Online ISBN: 978-3-319-75931-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation