Partial Information Endgame Databases

  • Yngvi Björnsson
  • Jonathan Schaeffer
  • Nathan R. Sturtevant
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4250)


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.


Partial Information Boundary Position Checker Proof Fourth Rank Alternate Move 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gasser, R.: Solving Nine Men’s Morris. Computational Intelligence 12, 24–41 (1996)CrossRefGoogle Scholar
  2. 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. 3.
    Nunn, J.: Secrets of Rook Endings. Gambit Books, B.T. Batsford Ltd., London (1999)Google Scholar
  4. 4.
    Romein, J., Bal, H.: Solving the Game of Awari Using Parallel Retrograde Analysis. IEEE Computer 36(10), 26–33 (2003)Google Scholar
  5. 5.
    Schaeffer, J.: One Jump Ahead. Springer, New York (1997)Google Scholar
  6. 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. 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. 8.
    Ströhlein, T.: Untersuchungen uber Kombinatorische Spiele. Dissertation, Fakultät für Allgemeine Wissenschaften der Technischen Hochschule München (1970)Google Scholar
  9. 9.
    Thompson, K.: Retrograde Analysis of Certain Endgames. ICCA Journal 9(3), 131–139 (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yngvi Björnsson
    • 1
  • Jonathan Schaeffer
    • 2
  • Nathan R. Sturtevant
    • 2
  1. 1.Department of Computer ScienceReykjavik UniversityReykjavikIceland
  2. 2.Department of Computing ScienceUniversity of AlbertaEdmonton, AlbertaCanada

Personalised recommendations