Search from over 60,000 research works

Advanced Search

Space-efficient Indexing of Chess Endgame Tables

[thumbnail of 2000c_ICGA_J_NHH_Space-Efficient_Indexing.pdf]
Preview
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Nalimov, E. V., Haworth, G. M. orcid id iconORCID: https://orcid.org/0000-0001-9896-1448 and Heinz, E. A. (2000) Space-efficient Indexing of Chess Endgame Tables. ICGA Journal, 23 (3). pp. 148-162. ISSN 1389-6911

Abstract/Summary

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 × 10^9 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
URI https://reading-clone.eprints-hosting.org/id/eprint/4562
Item Type Article
Refereed Yes
Divisions Science
Uncontrolled Keywords chess, efficiency, endgame table, index, Nalimov
Publisher The International Computer Games Association
Download/View statistics View download statistics for this item

Downloads

Downloads per month over past year

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

Search Google Scholar