Affiliations: Delft University of Technology/University of Limburg, The Netherlands
Note: [1] The research reported in this contribution has been carried out at the Delft University of Technology.
Note: [*] As of September 1, 1987, H.J. van den Herik has a professorial post at the University of Limburg, the Netherlands.
Note: [**] I.S.Herschberg and N.Nakad are affiliated to the Delft University of Technology, Department of Mathematics and Computer Science.
Note: [***] I.S.Herschberg and N.Nakad are affiliated to the Delft University of Technology, Department of Mathematics and Computer Science.
Abstract: This paper presents the construction and results of what is, to our knowledge, the first six-men-endgame database. Research was prompted by its occurrence in actual play and by its having been previously analyzed in the endgame literature. The latter analysis has been shown to be materially correct, though in need of revision in details, such as the optimal sequences of moves and the number of moves required. It should be noted that the complexity of research has been greatly added to by the many distinctions among classes required in order to reach any solution at all. It should also be stated, in fairness, that one Grandmaster’s insights have proved essential to the construction of the relevant databases, and have pointed to a potential and dangerous naivité on the part of chess programmers. The results of this paper correct some statements in the endgame literature and provide definite claims in some hitherto shadowy areas within this intriguing endgame.
DOI: 10.3233/ICG-1987-10402
Journal: ICGA Journal, vol. 10, no. 4, pp. 163-180, 1987
