Skip to main content
Article thumbnail
Location of Repository

Space-efficient indexing of endgame tables for chess

By Eugene V Nalimov, Guy McCrossan Haworth and Ernst A Heinz

Abstract

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.\ud \ud 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

Publisher: IKAT, University of Maastricht
Year: 2001
OAI identifier: oai:centaur.reading.ac.uk:4563

Suggested articles

Citations

  1. (1996). 6-Piece Endgames.
  2. (1989). A Correction to Some KRKB-Database Results.
  3. (1986). A Data Base on Data Bases.
  4. (1995). Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.”
  5. (1999). Endgame Databases and Efficient Index Schemes for Chess.
  6. (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.
  7. (1995). Exploiting Symmetry of Parallel Architectures.
  8. (2000). ftp://ftp.cis.uab.edu/pub/hyatt/TB/. Server providing CRAFTY and Nalimov’s EGTs and statistics.
  9. (1991). Group Graphs and Computational Symmetry on Massively Parallel Architecture.
  10. (1997). How DARKTHOUGHT plays Chess.
  11. (2000). http://chess.liveonthenet.com/chess/endings/index.shtml. Access to Thompson’s 5-man EGTs and maxDTC positions, and to Nalimov’s 3- to 6-man EGTs.
  12. (1999). KQQKQQ and the Kasparov-World Game.
  13. (1994). Multilinear Algebra and Chess Endgames. Games of No Chance
  14. (1989). Parallel Analysis of Certain Endgames.
  15. (2000). Private communication to Karrer,
  16. (1997). Report on the 15th World Microcomputer Chess Championship.
  17. (1986). Retrograde Analysis of Certain Endgames.
  18. (2000). Scalable Search in Computer Chess.
  19. (1992). Space-Efficient Indexing of Endgame Tables for Chess 105
  20. Table 13: Comparison of index ranges over 4-1 endgames.
  21. (1999). The 9th World Computer-Chess Championship: the SearchEngine Features of the Programs.
  22. (1985). The Construction of an Omniscient Endgame Database.
  23. (1993). Thompson: Quintets with Variations.
  24. (1970). Untersuchungen über kombinatorische Spiele. Dissertation, Fakultät für Allgemeine Wissenschaften der Technischen Hochschule München.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.