On Solving the Problem of 7-Piece Chess Endgames
- 作者: Zakharov V.1, Mal’kovskii M.1, Mostyaev A.1
-
隶属关系:
- Faculty of Computational Mathematics and Cybernetics, Moscow State University
- 期: 卷 45, 编号 3 (2019)
- 页面: 96-98
- 栏目: Article
- URL: https://journals.rcsi.science/0361-7688/article/view/176783
- DOI: https://doi.org/10.1134/S036176881903006X
- ID: 176783
如何引用文章
详细
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.
作者简介
V. Zakharov
Faculty of Computational Mathematics and Cybernetics, Moscow State University
编辑信件的主要联系方式.
Email: victor@ldis.cs.msu.su
俄罗斯联邦, Moscow, 119899
M. Mal’kovskii
Faculty of Computational Mathematics and Cybernetics, Moscow State University
编辑信件的主要联系方式.
Email: malk@cs.msu.su
俄罗斯联邦, Moscow, 119899
A. Mostyaev
Faculty of Computational Mathematics and Cybernetics, Moscow State University
编辑信件的主要联系方式.
Email: reistlin12@gmail.com
俄罗斯联邦, Moscow, 119899