Affiliations: [a] Ramat-Gan, Israel | [b] Jerusalem, Israel
Note: [1] Department of Computer Science, Bar-Ilan University, 52900 Ramat-Gan, Israel, fainshf@cs.biu.ac.il.
Note: [2] Department of Computer Science, Jerusalem College of Technology (Machon Lev), 21 Havaad Haleumi St., P.O.B. 16031, 91160 Jerusalem, Israel, kerner@jct.ac.il.
Abstract: Computerized chess composers of mate problems are rare. Moreover, so far they do not produce either impressive or creative new mate problems. In this paper, we describe a model called CHESS COMPOSER. This model uses a 64-bit representation, an ordered version of Iterative-Deepening Depth-First Search, and a quality function built with the help of two international masters in chess-problem composition. The result is applied on 100 known problems. It shows that the quality of 97 problems has been improved. Some of the improvements are rather impressive considering that all of the tested problems were composed by experienced composers. The new improved problems can be regarded as creative from the viewpoint of experts in chess compositions, because (1) they seem to be better, and (2) they are not too similar to the original problems.
DOI: 10.3233/ICG-2006-29102
Journal: ICGA Journal, vol. 29, no. 1, pp. 3-23, 2006
