On Solving the Problem of 7-Piece Chess Endgames
This paper discusses the brightest achievements in the field of chess informatics. We would especially like to note that, during the work of Mikhail Romanovich Shura-Bura at the Moscow State University (MSU), researchers from the MSU were leading this field: in 1973, the Kaissa program won the world computer chess championship. Later, the leadership was lost. It was regained in 2012, when scientists from the Faculty of Computational Mathematics and Cybernetics (CMC) of the MSU generated a complete tablebase of 7-piece chess endgames on a Lomonosov supercomputer and found the longest known checkmate in 549 moves.
- 2.Adel’son-Vel’skii, G.M., Arlazarov, V.L., Bitman, A.R., and Donskoi, M.V., Mashina igraet v shakhmaty (Machine Plays Chess), Moscow: Nauka, 1983.Google Scholar
- 3.Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., Lillicrap, T., Simonyan, K., and Hassabis, D., A general reinforcement learning algorithm that masters chess, shogi, and go through self-play, Science, 2018, vol. 362, no. 6419, pp. 1140–1144.MathSciNetCrossRefGoogle Scholar
- 4.Zakharov, V.B. and Makhnychev, V.S., Algorithm of retrograde analysis in supercomputing systems by the example of chess, Programmnye sistemy i instrumenty. Tematicheskii sbornik (Software Systems and Tools: Thematic Collection), Korolev, L., Korukhov, L.S., and Kostenko, V.A., Eds., Moscow: Mosk. Gos. Univ., 2010, vol. 11, pp. 45–52.Google Scholar
- 5.Zakharov, V.B. and Makhnychev, V.S., Creating chess tables of 7-piece endgames on a Lomonosov supercomputer, Superkomp’yut., 2013, no. 15, pp. 34–37.Google Scholar