Location of Repository

Data-mining chess databases

By Eiko Bleicher, Guy McCrossan Haworth and Harold M J F van der Heijden

Abstract

This is a report on the data-mining of two chess databases, the objective being to compare their sub-7-man content with perfect play as documented in Nalimov endgame tables. Van der Heijden’s ENDGAME STUDY DATABASE IV is a definitive collection of 76,132 studies in which White should have an essentially unique route to the stipulated goal. Chessbase’s BIG DATABASE 2010 holds some 4.5 million games. Insight gained into both database content and data-mining has led to some delightful surprises and created a further agenda

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

Suggested articles

Preview

Citations

  1. 2010), 8/8/7p/1P6/3kp3/7P/4K3/8 b 66: the latter apparently plays the losing
  2. In Type C zugzwangs, a null move is arguably (or given model fallible players, provably) the best move.
  3. Ke5?? rather than the comparatively obvious drawing Kc5 or even Kd5 - before agreeing a draw.
  4. (2010). Sub-7-man chess EGT-query

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