It is been 46 years since the first computer chess world championship was held in Stockholm in 1974, and there have now been 24 more with over 700 games played. This paper investigates a number of questions that a curious soul might ask regarding the results of these games, especially how they ended. The data provided herein attempts to answer several related questions. In addition, it presents data showing how ratings of the top engines have increased over the years.
Get full access to this article
View all access options for this article.
References
1.
Belle (chess machine). Available at: https://en.wikipedia.org/wiki/Belle_(chess_machine).
2.
Ferreira, D. (2013). The impact of search depth on chess playing strength. ICGA Journal, 36(2), 67–80. doi:10.3233/ICG-2013-36202.
3.
Frey, P. (1977a). The Paul Masson American Chess Championship. In Chess Skill in Man and Machine (pp. 201–203). Springer.
4.
Frey, P. (1977b). CHESS 4.5 – The Northwestern University chess program. In Chess Skill in Man and Machine (pp. 82–118). Springer.
5.
Gillogly, J.J. (1978). Performance analysis of the technology chess program. PhD thesis, CMU.
6.
Heinz, E.A. (1998). Dark Thought goes deep. ICCA Journal, 21(4), 228–244.
Levy, D. (1978). Man beats machine! Chess Life & Review, 600–603.
11.
Newborn, M. (1986). An hypothesis concerning the strength of chess programs. ICCA Journal, 8(4), 209–215.
12.
Newborn, M. (2003). Chess program strength, search depth, and computer speed. In Appendix H, Deep Blue: An Artificial Intelligence Milestone (pp. 291–294). Springer. doi:10.1007/978-0-387-21790-1.
13.
Schaeffer, J., Burch, N., Björnsson, K.A., Müller, M., Lake, R., Lu, P. & Sutphen, S. (2007). Checkers is solved. Science, 317(5844), 1518–1522. doi:10.1126/science.1144079.
14.
Swedish Chess Computer Association. Available at: https://en.wikipedia.org/wiki/Swedish_Chess_Computer_Association.
15.
Thompson, K. (1982). Computer chess strength. In M.R.B.Clarke (Ed.), Advances in Computing 3 (pp. 55–56). Oxford: Pergamon Press.
