TY - JOUR
T1 - A deep improver of two-move chess mate problems
AU - HaCohen-Kerner, Yaakov
AU - Fainshtein, Fridel
PY - 2006/8/1
Y1 - 2006/8/1
N2 - Computer composition of high-quality chess mate problems is relatively an uninvestigated research domain. A previous model, called an Improver of Chess Problems, which is based on a hill-climbing search, improved slightly the quality of 10 out of 36 known problems (about 28%). In this article, we describe an improved model, called Deep Improver of Chess Problems. This model uses an improved version of Bounded Depth First Search. The experiment, we carry out on the same problems, show that the quality of 32 problems (about 89%) has been improved. Moreover, some of the improvements are meaningful and impressive.
AB - Computer composition of high-quality chess mate problems is relatively an uninvestigated research domain. A previous model, called an Improver of Chess Problems, which is based on a hill-climbing search, improved slightly the quality of 10 out of 36 known problems (about 28%). In this article, we describe an improved model, called Deep Improver of Chess Problems. This model uses an improved version of Bounded Depth First Search. The experiment, we carry out on the same problems, show that the quality of 32 problems (about 89%) has been improved. Moreover, some of the improvements are meaningful and impressive.
UR - http://www.scopus.com/inward/record.url?scp=33748486002&partnerID=8YFLogxK
U2 - 10.1080/01969720600683387
DO - 10.1080/01969720600683387
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:33748486002
SN - 0196-9722
VL - 37
SP - 443
EP - 462
JO - Cybernetics and Systems
JF - Cybernetics and Systems
IS - 5
ER -