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.

This is a preview of subscription content, access via your institution.


  1. 1

    Shannon, C.E., Programming a computer for playing chess, Philos. Mag., 1950, vol. 41, no. 314, pp. 256–275.

    MathSciNet  Article  MATH  Google Scholar 

  2. 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.

  3. 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.

    MathSciNet  Article  Google Scholar 

  4. 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. 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.

  6. 6

    Zakharov, V.B., Mal’kovskii, M.G., and Shchukin, Y.V., Compression of underdetermined data in a 7-piece chess table, Moscow Univ. Comput. Math. Cybern., 2016, vol. 40, no. 1, pp. 47–52.

    MathSciNet  Article  Google Scholar 

Download references

Author information



Corresponding authors

Correspondence to V. B. Zakharov or M. G. Mal’kovskii or A. I. Mostyaev.

Additional information

Translated by Yu. Kornienko

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Zakharov, V.B., Mal’kovskii, M.G. & Mostyaev, A.I. On Solving the Problem of 7-Piece Chess Endgames. Program Comput Soft 45, 96–98 (2019). https://doi.org/10.1134/S036176881903006X

Download citation