Comparing typical opening move choices made by humans and chess engines

Computer Journal

Volumn 50, Issue 5, 2007, Pages 567-573

  Levene, Mark ^a   Bar Ilan, Judit ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Chess engines; Computer chess; Man versus machine; Nonparametric association measures; Opening book

Indexed keywords

AUTOMATION; DATABASE SYSTEMS; MAN MACHINE SYSTEMS;

CHESS ENGINES; COMPUTER CHESS; NONPARAMETRIC ASSOCIATION; OPENING BOOK;

COMPUTER PROGRAMMING;

EID: 34548734802     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm025     Document Type: Article

References (22)

1. Shannon, C. (1950) Programming a computer for playing Chess. Philos. Mag., 41, 256-275.
2. Newborn, M. (2002) Deep Blue: An Artificial Intelligence Milestone Springer-Verlag, New York, NY.
3. Donninger, C. and Lorenz, U. (2005) The Hydra project. Xcell J., 53, 94-97.
4. Prasad, R. (2003). Man vs. machine - the endless fascination. http://www.chessbase.com/newsdetail.asp?newsid=1296.
5. ChessBase News (2006). Kramnik vs Deep Fritz: Computer wins match by 4: 2. http://www.chessbase.com/newsdetai1.asp?newsid=3524.
6. Jacobs, B., Aagaard, J. and Emms, J. (2003) Chess Software User's Guide. Everyman Chess, London, UK.
7. Campbell, M., Hoane, A. Jr. and Hsu, F. (2002) Deep Blue. Artif. Intell., 134, 57-83.
8. Campbell, M. (1999) Knowledge discovery in Deep Blue. Commun. ACM, 22, 65-67.
9. Donninger, C. and Lorenz, U. (2005) Innovative opening-book handling. Proc. Conf. on Advances in Computer Games, Taipei, Taiwan, September, INCS, 4250, pp. 1-10. Springer-Verlag, New York, NY.
10. Lincke, T. (2000) Strategies for the automatic construction of opening books. Proc. Int. Con. on Computers and Games (CG), Hamamatsu, Japan, LNCS, 4250, pp. 74-86. Springer-Verlag, New York, NY.
11. Buro, M. (1999) Towards opening book learning. Int. Comput. Chess Assoc. J., 22, 98-102.
12. Hyatt, R. (1999) Book learning - a methodology to tune an opening book automatically. Int. Comput. Chess Assoc. J., 22, 3-12.
13. Levene, M. and Bar-Ilan, J. (2005) Comparing move choices of chess search engines. Int. Comput. Games Assoc. J. (ICGA), 28, 67-76.
14. Bar-Ilan, J., Mat-Hassan, M. and Levene, M. (2006) Methods for comparing rankings of search engine results. Comput. Netw., 50, 1448-1463.
15. Fagin, R., Kumar, R. and Sivakumar, D. (2003) Comparing top k lists. SIAM J. Discret. Math., 17, 134-160.
16. Grosse, I., Bernaola-Galv́an, P., Carpena, P., Román-Rold́an, R., Oliver, J. and Stanley, H. (2002) Analysis of symbolic sequences using the Jensen-Shannon divergence. Phys. Rev. E, 65, 041905-1-041905-16.
17. Endres, D. and Schindelin, J. (2003) A new metric for probability distributions. IEEE Trans. Inf. Theory, 49, 1858-1860.
18. Gibbons, J. and Chakraborti, S. (2003) Nonparametric Statisitcal Inference (4th edn). Marcel Dekker, New York, NY.
19. Davison, A. and Hinkley, D. (1997) Bootstrap Methods and their Application, Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, UK.
20. Gomboc, D., Buro, M. and Marsland, T. (2005) Tuning evaluation functions by maximizing concordance. Theor. Comput. Sci., 349, 202-229.
21. Fürnkranz, J. (2001) Machine Learning in Games: A Survey. In Fürnkranz, J. and Kubat, M. (eds.), Machines that Learn to Play Games, pp. 11-59. Nova Science Publishers, Huntington, NY.
22. Lucas, S. and Kendall, G. (2006) Evolutionary computation and games. IEEE Comput. Intell. Mag., 1, 10-18.