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.
Chapter PDF
Similar content being viewed by others
References
Sezgin, F. (ed.): Book on Chess (Kitab al-shatranj): Selected Texts from al-Adli, Abu Bakr al-Suli and Others. Institute for the History of Arabic-Islamic Science, Johann Wolfgang Goethe University, Frankfurt am Main (1986)
Giddins, S.: Problems, Problems, Problems. ChessBase News (April 16, 2010), http://www.chessbase.com/newsdetail.asp?newsid=6261
Horvitz, E., Getoor, L., Guestrin, C., Hendler, J., Konstan, J., Subramanian, D., Wellman, M., Kautz, H.: AI Theory and Practice: A Discussion on Hard Challenges and Opportunities Ahead. AI Magazine 31(3), 103–144 (2010)
Hsu, F.-H.: Cracking Go. IEEE Spectrum 44(10), 50–55 (2007)
Ekbia, H.R.: Artificial Dreams: The Quest for Nonbiological Intelligence. Cambridge University Press, Cambridge (2008)
Hartmann, D.: Human Superiority Restored. ICGA Journal 33(3), 150 (2010)
Boden, M.A.: Computer Models of Creativity. AI Magazine 30(3), 23–34 (2009)
Manaris, B., Roos, P., Penousal, M., Krehbiel, D., Pellicoro, L., Romero, J.: A Corpus-Based Hybrid Approach to Music Analysis and Composition. In: The 22nd Conference on Artificial Intelligence (AAAI 2007), pp. 839–845. AAAI Press, Vancouver (2007)
Rigau, J., Feixas, M., Sbert, M.: Conceptualizing Birkhoff’s Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity. In: The Eurographics Workshop on Computational Aesthetics in Graphics, Visualization and Imaging, pp. 105–112. Eurographics Assoc., Banff (2007)
Iqbal, M.A.M.: A Discrete Computational Aesthetics Model for a Zero-sum Perfect Information Game. Ph.D. thesis. Faculty of Computer Science and Information Technology. University of Malaya, Kuala Lumpur, Malaysia (2008), http://metalab.uniten.edu.my/~azlan/Research/pdfs/phd_thesis_azlan.pdf
Iqbal, A.: Aesthetics in Mate-in-3 Combinations, Part I: Combinatorics and Weights. ICGA Journal 33(3), 140–148 (2010)
Schlosser, M.: Computers and Chess Problem Composition. ICCA Journal 11(4), 151–155 (1988)
Schlosser, M.: Can a Computer Compose Chess Problems? In: Beal, D.F. (ed.) Advances in Computer Chess, vol. 6, pp. 117–131. Ellis Horwood Ltd., Chichester (1991)
Haworth, G.M.: Chess Endgame Knowledge Advances. ICGA Journal 33(3), 149 (2010)
Noshita, K.N.: A Note on Algorithmic Generation of Tsume-Shogi Problems. In: The Game Programming Workshop 1996, Kanagawa, Japan, pp. 27–33 (1996)
Hirose, M., Matsubara, H., Itoh, T.: The Composition of Tsume-Shogi Problems. In: Advances in Computer Chess, vol. 8, pp. 299–318. Universiteit Maastricht, the Netherlands (1996)
Watanabe, H., Iida, H., Uiterwijk, J.W.H.M.: Automatic Composition of Shogi Mating Problems. In: Games in AI Research, pp. 109–123. Universiteit Maastricht, the Netherlands (2000)
Horiyama, T., Ito, H., Iwama, K., Kawahara, J.: Enumeration of Tsume-Shogi Diagrams by the Reverse Method. In: The International Conference on Informatics Education and Research for Knowledge-Circulating Society, Kyoto, Japan, pp. 193–196 (2008)
HaCohen-Kerner, Y., Cohen, N., Shasha, E.: An Improver of Chess Problems. Cybernetics and Systems 30(5), 441–465 (1999)
Fainshtein, F., HaCohen-Kerner, Y.: A Chess Composer of Two-Move Mate Problems. ICGA Journal 29(1), 32–39 (2006)
Fainshtein, F., HaCohen-Kerner, Y.: A Deep Improver of Two-move Chess Mate Problems. Cybernetics and Systems 37(5), 443–462 (2006)
Bilalić, M., McLeod, P., Gobet, F.: Inflexibility of Experts – Reality or Myth? Quantifying the Einstellung Effect in Chess Masters. Cognitive Psychology 56(2), 73–102 (2008)
Walls, B.P.: Beautiful Mates: Applying Principles of Beauty to Computer Chess Heuristics. M.Sc. dissertation. University of Sussex, UK (1997)
Albrecht, H.: How Should the Role of a (Chess) Tourney Judge Be Interpreted? The Problemist 7, 21–218 (2000)
Iqbal, A.: Aesthetics in Mate-in-3 Combinations, Part II: Normality. ICGA Journal 33(4), 202–211 (2010)
Thomson, K.: Retrograde Analysis of Certain Endgames. ICCA Journal 9(3), 131–139 (1986)
Smullyan, R.: Chess Mysteries of Sherlock Holmes: Fifty Tantalizing Problems of Chess Detection. Random House Puzzles, New York (1994)
Lipton, M., Matthews, R.C.O., Rice, J.: Chess Problems: Introduction to an Art. Citadel Press, New York (1965)
Iqbal, A.: Evaluation of Economy in a Zero-sum Perfect Information Game. The Computer Journal 51(4), 408–418 (2008)
Sadikov, A., Bratko, I.: Search Versus Knowledge Revisited Again. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 172–180. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iqbal, A. (2011). Increasing Efficiency and Quality in the Automatic Composition of Three-Move Mate Problems. In: Anacleto, J.C., Fels, S., Graham, N., Kapralos, B., Saif El-Nasr, M., Stanley, K. (eds) Entertainment Computing – ICEC 2011. ICEC 2011. Lecture Notes in Computer Science, vol 6972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24500-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-24500-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24499-5
Online ISBN: 978-3-642-24500-8
eBook Packages: Computer ScienceComputer Science (R0)