Affiliations: Delft University of Technology, University of Limburg, The Netherlands
Note: [1] The research reported in this contribution has been made possible by the Netherlands Organization for Advancement of Pure Research (ZWO), dossier number 39 SC 68-129, notably by their donation of computer time on the Amsterdam (SARA) Cyber 205 The research was carried out at the Delft University of Technology.
Note: [*] S T Dekker and I S Herschberg are affiliated to the Delft University of Technology, the former in the Department of Physics, the latter in the Department of Mathematics and Computer Science.
Note: [**] As of September 1,1987, H J van den Henk has a professional post in the University of Limburg, the Netherlands.
Note: [***] S T Dekker and I S Herschberg are affiliated to the Delft University of Technology, the former in the Department of Physics, the latter in the Department of Mathematics and Computer Science.
Abstract: The endgame KNNKP(h) is investigated in the ultimate sense, giving rise to a full data-base including all conversions of that game. It turns out that the only possible conversions are to KNNKA, where A stands for any of Q, R, B or N, and to KNKP(h). Other theoretically possible conversions are excluded by lemmatics, i.e., the application of theorem-proving to heuristics. The paper distinguishes prospective analysis, retrospective analysis and the backward-chaining construction. The latter is complicated by the presence of the two conversions. It is believed that our database is the first one to deal with a black Pawn, pursuing all the consequences beyond conversion in an ultimate sense. An anthology of results is presented as well as an application to a famous position (Smyslov-Lilienthal, 1941), now shown to have been erroneously analysed by several authors.
DOI: 10.3233/ICG-1987-10304
Journal: ICGA Journal, vol. 10, no. 3, pp. 125-138, 1987
