Position criticality in chess endgames

Lists

Tools

Haworth, G. ORCID: https://orcid.org/0000-0001-9896-1448 and Rusz, A. (2012) Position criticality in chess endgames. In: Advances in Computer Games. Lecture Notes in Computer Science, 7168. Springer, Heidelberg, pp. 244-257.

Slideshow (slides and video) - Presentation
· Please see our End User Agreement before downloading.
7MB

Preview

Text (post conference postscript) - Accepted Version
· Please see our End User Agreement before downloading.
598kB

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1007/978-3-642-31866-5_21

Abstract/Summary

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.

Item Type:	Book or Report Section
Refereed:	Yes
Divisions:	Science
ID Code:	23799
Uncontrolled Keywords:	chess variant, endgame, repetition, Starchess, study, uniqueness
Additional Information:	13th International Conference, ACG 2011 Tilburg, The Netherlands, November 20-22, 2011
Publisher:	Springer

Download Statistics

Downloads

Downloads per month over past year

Altmetric

Related URLs

Deposit Details

References

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

University Staff: Request a correction | Centaur Editors: Update this record

University of Reading

CentAUR: Central Archive at the University of Reading

Accessibility navigation

Position criticality in chess endgames

Abstract/Summary

Downloads

Page navigation

See also

Footer navigation