Accessibility navigation

Data-mining chess databases

Lists
Tools

Bleicher, E., Haworth, G. M. ORCID: https://orcid.org/0000-0001-9896-1448 and van der Heijden, H. M. J. F. (2010) Data-mining chess databases. ICGA Journal, 33 (4). pp. 212-214. ISSN 1389-6911

[img]
Preview
 Text - Published Version
· Please see our End User Agreement before downloading.
73kB

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Abstract/Summary

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.

Item Type:Article
Refereed:Yes
Divisions:Science
ID Code:17497
Uncontrolled Keywords:castling, chess studies, cook, correctness, database, data-mining, DGT, dual, DTM, games, optimality, zugzwang
Publisher:The International Computer Games Association
Download Statistics

Downloads

Downloads per month over past year

Related URLs
Deposit Details
References

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

Page navigation

See also