Advertisement

Position Criticality in Chess Endgames

  • Guy McC. Haworth
  • Á. Rusz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7168)

Abstract

Some 50,000 Win Studies in Chess challenge White to find an effectively unique route to a win. Judging the impact of less than absolute uniqueness requires both technical analysis and artistic judgment. Here, for the first time, an algorithm is defined to help analyse uniqueness in endgame positions objectively. The key idea is to examine how critical certain positions are to White in achieving the win. The algorithm uses sub-n-man endgame tables (EGTs) for both Chess and relevant, adjacent variants of Chess. It challenges authors of EGT generators to generalise them to create EGTs for these chess variants. It has already proved efficient and effective in an implementation for Starchess, itself a variant of chess. The approach also addresses a number of similar questions arising in endgame theory, games, and compositions.

Keywords

Alternative Move Position Criticality Adjacent Variant Unique Route Null 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beasley, J.: Depth and Beauty, the chess endgame studies of Artur Mandler (2003)Google Scholar
  2. 2.
    Bleicher, E., Haworth, G.McC: 6-Man Chess and Zugzwangs. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 123–135. Springer, Heidelberg (2010)Google Scholar
  3. 3.
    Bleicher, E.: DTM EGT query facility (2007), http://www.k4it.de/index.php?topic=egtb&lang=en
  4. 4.
    Bourzutschky, M., Konoval, Y.: News in Endgame Databases. EG 17-185, 220–229 (2011)Google Scholar
  5. 5.
    Bourzutschky, M.S., Tamplin, J.A., Haworth, G.McC: Chess endgames: 6-man data and strategy. Theoretical Computer Science 349(2), 140–157 (2005) ISSN 0304-3975Google Scholar
  6. 6.
    Fahrni, H.: Das Endspiel im Schach, Leipzig (1917)Google Scholar
  7. 7.
    FIDE: The Laws of Chess. FIDE Handbook E.1.01A (2009), http://www.fide.com/component/-handbook/?id=124&view=article
  8. 8.
    Grondijs, H.: No Rook Unturned. A Tour around the Saavedra Study (2004)Google Scholar
  9. 9.
    Haworth, G.McC, van der Heijden, H.M.J.F., Bleicher, E.: Zugzwangs in Chess Studies. ICGA Journal 34(2), 82–88 (2011)Google Scholar
  10. 10.
    Haworth, G.McC, Bleicher, E., van der Heijden, H.M.J.F.: Uniqueness in chess studies. ICGA Journal 34(1), 22–24 (2011)Google Scholar
  11. 11.
    Haworth, G.McC: The Scorched Earth Algorithm. Presentation to the UK Chess Endgame Study Circle. Pushkin House, London (2009)Google Scholar
  12. 12.
    Haworth, G.McC: Strategies for Constrained Optimisation. ICGA J. 23(1), 9–20 (2000)Google Scholar
  13. 13.
    van der Heijden, H.M.J.F.: HHdbIV, HvdH’s Endgame Study Database IV (2010), http://www.hhdbiv.nl/
  14. 14.
    Karrer, P.: KQQKQP and KQPKQP. ICCA Journal 23(2), 75–84 (2000)Google Scholar
  15. 15.
    Konoval, Y., Bourzutschky, M.: First 6-man study requiring all three underpromotions. British Chess Magazine 130(1) (2010)Google Scholar
  16. 16.
    Konoval, Y., Bourzutschky, M.: Malyutka requiring P=R and P=N. 64 Shakhmatnoe Obozrenie 7 (2009)Google Scholar
  17. 17.
    Lasker, E.: Common Sense in Chess (1896)Google Scholar
  18. 18.
    Nalimov, E.V., Haworth, G.McC, Heinz, E.: Space-Efficient Indexing of Endgame Databases for Chess. In: van den Herik, H.J., Monien, B. (eds.) Advances in Computer Games 9, vol. 1, pp. 93–113. Institute for Knowledge and Agent Technology (IKAT), Maastricht (2001) ISBN 9-0621-6576-1Google Scholar
  19. 19.
    Nunn, J.: Secrets of Minor-Piece Endings. B.T. Batsford, London (1995)Google Scholar
  20. 20.
    Nunn, J.: Secrets of Pawnless Endings. B.T. Batsford, London. ISBN 0-7134-7508-0. Expanded Edition 2 including 6-man endgames (2002). Gambit. ISBN 1-9019-8365-X (1994) Google Scholar
  21. 21.
    Pritchard, D.B.: Popular Chess Variants. Batsford (2000) ISBN 978-0713485783Google Scholar
  22. 22.
    Pritchard, D.B.: The Classified Encyclopedia of Chess Variants. 2nd revised edition, edited and published by J.D.Beasley. Google Scholar
  23. 23.
    Roycroft, A.J.: Test tube chess: a comprehensive introduction to the endgame study (1972)Google Scholar
  24. 24.
    Roycroft, A.J.: Expert against the Oracle. In: Hayes, J.E., Michie, D., Richards, J. (eds.) Machine Intelligence 11, pp. 347–373 (1988)Google Scholar
  25. 25.
    Rusz, A.: A technical discussion of the Hornecker study HHdbIV#75649 (2011), http://kirill-kryukov.com/chess/discussion-board-/viewtopic.php?f=6&t=6036#p64616
  26. 26.
    Starchess rules (2011), polgarstarchess.com/Rules.doc
  27. 27.
    Vlasak, E.: Endgame database news (2005), http://www.vlasak.biz/tablebase.htm
  28. 28.
    Winter, E.: Chess Notes #5814 (2011), http://www.chesshistory.com/winter/winter51.html

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Guy McC. Haworth
    • 1
  • Á. Rusz
    • 2
  1. 1.School of Systems EngineeringUniversity of ReadingUK
  2. 2.BudapestHungary

Personalised recommendations