Data-Mining Chess Databases

Article type: Research Article

Authors: Bleicher, E. | Haworth, G.McC.¹ | van der Heijden, H.M.J.F.

Affiliations: [a] Berlin, Germany | [b] Reading, U.K. | [c] Deventer, The Netherlands

Note: [1] The University of Reading, Berkshire, UK, RG6 6AH. email: [email protected].

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.

DOI: 10.3233/ICG-2010-33404

Journal: ICGA Journal, vol. 33, no. 4, pp. 212-214, 2010