The Legitimacy of Positions in Endgame Databases¹

Article type: Research Article

Authors: Lippold, D.^{; *}

Affiliations: Karserslautern, Germany

Note: [1] This article is based on a paper on the analysis of simple chess endgames which is available from the WWW site at http//www.umx-ag.uni-kl.de/-lippold/Endsplel/.

Note: [*] Universitat Karserslautern, 67653 Karserslautern, Germany. E-mail: lippold@umx-ag.uni-kl.de.

Abstract: Current endgame databases provide optimal sequences of moves from a given position to conversion or to mate. They do not investigate whether the given position is legitimate. This contribution considers the database as a model of the particular chess configuration under investigation and attempts to classify the positions in legitimate and illegitimate positions. Assuming a position to be legitimate if it can be reached from the starting position by legal moves only, the question is what means do we need to prove the legitimacy of a position. For this purpose, we first define three new concepts initially illegitimate, derivedly illegitimate and isolatedly illegitimate. Then we propose a constructive procedure which enables us to show that a position can be reached. Related to the new concepts we introduce a broad definition of illegitimacy (based on initially illegitimate only) and a narrow definition (taking into account also derivedly illegitimate). For both cases we have examined the 3- and 4-man databases of which results are given. Further research of 5- and 6-man databases is envisaged.

DOI: 10.3233/ICG-1997-20103

Journal: ICGA Journal, vol. 20, no. 1, pp. 20-28, 1997