Skip to main content

Partial Information Endgame Databases

  • Conference paper
Book cover Advances in Computer Games (ACG 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4250))

Included in the following conference series:

Abstract

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gasser, R.: Solving Nine Men’s Morris. Computational Intelligence 12, 24–41 (1996)

    Article  Google Scholar 

  2. Lincke, T.R.: Exploring the Computational Limits of Large Exhaustive Search Problems. Ph.D. thesis, Swiss Federal Institute of Technology (2002)

    Google Scholar 

  3. Nunn, J.: Secrets of Rook Endings. Gambit Books, B.T. Batsford Ltd., London (1999)

    Google Scholar 

  4. Romein, J., Bal, H.: Solving the Game of Awari Using Parallel Retrograde Analysis. IEEE Computer 36(10), 26–33 (2003)

    Google Scholar 

  5. Schaeffer, J.: One Jump Ahead. Springer, New York (1997)

    Google Scholar 

  6. Schaeffer, J., Bjornsson, Y., Burch, N., Kishimoto, A., Müller, M., Lake, R., Lu, P., Sutphen, S.: Solving Checkers. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 292–297 (2005)

    Google Scholar 

  7. Schaeffer, J., Bjornsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S.: Building the 10-piece Checkers Endgame Databases. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) 10th Advances in Computer Games (ACG10), Many Games, Many Challenges, pp. 193–210. Kluwer Academic Publishers, Boston (2004)

    Google Scholar 

  8. Ströhlein, T.: Untersuchungen uber Kombinatorische Spiele. Dissertation, Fakultät für Allgemeine Wissenschaften der Technischen Hochschule München (1970)

    Google Scholar 

  9. Thompson, K.: Retrograde Analysis of Certain Endgames. ICCA Journal 9(3), 131–139 (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Björnsson, Y., Schaeffer, J., Sturtevant, N.R. (2006). Partial Information Endgame Databases. In: van den Herik, H.J., Hsu, SC., Hsu, Ts., Donkers, H.H.L.M.(. (eds) Advances in Computer Games. ACG 2005. Lecture Notes in Computer Science, vol 4250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922155_2

Download citation

  • DOI: https://doi.org/10.1007/11922155_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48887-3

  • Online ISBN: 978-3-540-48889-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics