Location of Repository

Space-efficient Indexing of Chess Endgame Tables

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

Publisher: The International Computer Games Association
Year: 2000
OAI identifier: oai:centaur.reading.ac.uk:4562

Suggested articles

Preview

Citations

  1. [Dva Konya protiv pešek. Sbornik šakhmatnykh étyudov.] Partly republished (1937) in Collection of Chess Studies, with a Supplement on the Theory of the End-Game of Two Knights against Pawns.
  2. (1996). 6-Piece Endgames.
  3. (1989). A Correction to Some KRKB-Database Results.
  4. (1986). A Data Base on Data Bases.
  5. (1995). Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.”
  6. (1985). Company, the latter again re-published
  7. (1999). Endgame Databases and Efficient Index Schemes for Chess.
  8. (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.
  9. (1995). Exploiting Symmetry of Parallel Architectures.
  10. (1998). Four Queen study.
  11. (2000). ftp://ftp.cis.uab.edu/pub/hyatt/TB/. Server providing CRAFTY and Nalimov’s EGTs and statistics.
  12. (1991). Group Graphs and Computational Symmetry on Massively Parallel Architecture.
  13. (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.
  14. (1994). Multilinear Algebra and Chess Endgames. Games of No Chance
  15. (1989). Parallel Analysis of Certain Endgames.
  16. (2000). Private communication to Karrer,
  17. (1997). Report on the 15th World Microcomputer Chess Championship.
  18. (1986). Retrograde Analysis of Certain Endgames.
  19. (2000). Scalable Search in Computer Chess.
  20. (1997). Space-Efficient Indexing of Chess Endgame Tables 157
  21. (1999). The 9th World Computer-Chess Championship: the Search-Engine Features of the Programs.
  22. (1987). The Art of Chess Composition.
  23. (1985). The Construction of an Omniscient Endgame Database.
  24. (1992). Thompson: All About Five Men.
  25. (1993). Thompson: Quintets with Variations.
  26. (1970). Untersuchungen über kombinatorische Spiele. Dissertation, Fakultät für Allgemeine Wissenschaften der Technischen Hochschule München.
  27. (1934). Два коня против пешек (теоретический очерк). Сборник шахматных этюдов,

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