Increasing efficiency and quality in the automatic composition of three-move mate problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

In this article, we demonstrate the use of composing 'experience' in the form of piece location probability values derived from a database of matein- 3 chess problems. This approach was compared against a 'random' one. Comparisons were made using 'experiences' derived from three different databases, i.e. problems by human composers (HC), computer-generated compositions that used the HC experience (CG), and mating 'combinations' taken from tournament games between humans (TG). Each showed a reasonable and statistically significant increase in efficiency compared to the random one but not each other. Aesthetically, the HC and CG were better than the others. The results suggest that composing efficiency and quality can be improved using simple probability information derived from human compositions, and unexpectedly even from the computer-generated compositions that result. Additionally, these improvements come at a very low computational cost. They can be used to further aid and entertain human players and composers.

Original languageEnglish
Title of host publicationEntertainment Computing, ICEC 2011 - 10th International Conference, Proceedings
Pages186-197
Number of pages12
DOIs
Publication statusPublished - 29 Nov 2011
Event10th International Conference on Entertainment Computing, ICEC 2011 - Vancouver, BC, Canada
Duration: 05 Oct 201108 Oct 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6972 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Entertainment Computing, ICEC 2011
CountryCanada
CityVancouver, BC
Period05/10/1108/10/11

Fingerprint

Chemical analysis
Tournament
Human
Computational Cost
Costs
Game
Demonstrate
Experience

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Mohamed Iqbal, M. A. (2011). Increasing efficiency and quality in the automatic composition of three-move mate problems. In Entertainment Computing, ICEC 2011 - 10th International Conference, Proceedings (pp. 186-197). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6972 LNCS). https://doi.org/10.1007/978-3-642-24500-8_20
Mohamed Iqbal, Mohammed Azlan. / Increasing efficiency and quality in the automatic composition of three-move mate problems. Entertainment Computing, ICEC 2011 - 10th International Conference, Proceedings. 2011. pp. 186-197 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0ca4a987befe469c88acc121425367e6,
title = "Increasing efficiency and quality in the automatic composition of three-move mate problems",
abstract = "In this article, we demonstrate the use of composing 'experience' in the form of piece location probability values derived from a database of matein- 3 chess problems. This approach was compared against a 'random' one. Comparisons were made using 'experiences' derived from three different databases, i.e. problems by human composers (HC), computer-generated compositions that used the HC experience (CG), and mating 'combinations' taken from tournament games between humans (TG). Each showed a reasonable and statistically significant increase in efficiency compared to the random one but not each other. Aesthetically, the HC and CG were better than the others. The results suggest that composing efficiency and quality can be improved using simple probability information derived from human compositions, and unexpectedly even from the computer-generated compositions that result. Additionally, these improvements come at a very low computational cost. They can be used to further aid and entertain human players and composers.",
author = "{Mohamed Iqbal}, {Mohammed Azlan}",
year = "2011",
month = "11",
day = "29",
doi = "10.1007/978-3-642-24500-8_20",
language = "English",
isbn = "9783642244995",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "186--197",
booktitle = "Entertainment Computing, ICEC 2011 - 10th International Conference, Proceedings",

}

Mohamed Iqbal, MA 2011, Increasing efficiency and quality in the automatic composition of three-move mate problems. in Entertainment Computing, ICEC 2011 - 10th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6972 LNCS, pp. 186-197, 10th International Conference on Entertainment Computing, ICEC 2011, Vancouver, BC, Canada, 05/10/11. https://doi.org/10.1007/978-3-642-24500-8_20

Increasing efficiency and quality in the automatic composition of three-move mate problems. / Mohamed Iqbal, Mohammed Azlan.

Entertainment Computing, ICEC 2011 - 10th International Conference, Proceedings. 2011. p. 186-197 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6972 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Increasing efficiency and quality in the automatic composition of three-move mate problems

AU - Mohamed Iqbal, Mohammed Azlan

PY - 2011/11/29

Y1 - 2011/11/29

N2 - In this article, we demonstrate the use of composing 'experience' in the form of piece location probability values derived from a database of matein- 3 chess problems. This approach was compared against a 'random' one. Comparisons were made using 'experiences' derived from three different databases, i.e. problems by human composers (HC), computer-generated compositions that used the HC experience (CG), and mating 'combinations' taken from tournament games between humans (TG). Each showed a reasonable and statistically significant increase in efficiency compared to the random one but not each other. Aesthetically, the HC and CG were better than the others. The results suggest that composing efficiency and quality can be improved using simple probability information derived from human compositions, and unexpectedly even from the computer-generated compositions that result. Additionally, these improvements come at a very low computational cost. They can be used to further aid and entertain human players and composers.

AB - In this article, we demonstrate the use of composing 'experience' in the form of piece location probability values derived from a database of matein- 3 chess problems. This approach was compared against a 'random' one. Comparisons were made using 'experiences' derived from three different databases, i.e. problems by human composers (HC), computer-generated compositions that used the HC experience (CG), and mating 'combinations' taken from tournament games between humans (TG). Each showed a reasonable and statistically significant increase in efficiency compared to the random one but not each other. Aesthetically, the HC and CG were better than the others. The results suggest that composing efficiency and quality can be improved using simple probability information derived from human compositions, and unexpectedly even from the computer-generated compositions that result. Additionally, these improvements come at a very low computational cost. They can be used to further aid and entertain human players and composers.

UR - http://www.scopus.com/inward/record.url?scp=82055175080&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=82055175080&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-24500-8_20

DO - 10.1007/978-3-642-24500-8_20

M3 - Conference contribution

SN - 9783642244995

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 186

EP - 197

BT - Entertainment Computing, ICEC 2011 - 10th International Conference, Proceedings

ER -

Mohamed Iqbal MA. Increasing efficiency and quality in the automatic composition of three-move mate problems. In Entertainment Computing, ICEC 2011 - 10th International Conference, Proceedings. 2011. p. 186-197. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-24500-8_20