Accessibility navigation

Space-efficient indexing of endgame tables for chess

Nalimov, E. V., Haworth, G. M. ORCID: and Heinz, E. A. (2001) Space-efficient indexing of endgame tables for chess. Advances in Computer Games 9. pp. 93-113.

Text - Published 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.


Chess endgame tables should provide efficiently the value and depth of any required position during play. The indexing of an endgame’s positions is crucial to meeting this objective. This paper updates Heinz’ previous review of approaches to indexing and describes the latest approach by the first and third authors. Heinz’ and Nalimov’s endgame tables (EGTs) encompass the en passant rule and have the most compact index schemes to date. Nalimov’s EGTs, to the Distance-to-Mate (DTM) metric, require only 30.6 × 109 elements in total for all the 3-to-5-man endgames and are individually more compact than previous tables. His new index scheme has proved itself while generating the tables and in the 1999 World Computer Chess Championship where many of the top programs used the new suite of EGTs.

Item Type:Article
ID Code:4563
Uncontrolled Keywords:chess, efficient, endgame, endgame table, index, Nalimov
Publisher:IKAT, University of Maastricht


Downloads per month over past year

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

Page navigation