Accessibility navigation

Position criticality in chess endgames

Haworth, G. ORCID: 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.

[img] Slideshow (slides and video) - Presentation
· Please see our End User Agreement before downloading.

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


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


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
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


Downloads per month over past year

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

Page navigation