Compression of underdetermined data in a 7-piece chess table

  • V. B. ZakharovEmail author
  • M. G. Mal’kovskii
  • V. Yu. Shchukin


Block compression algorithms used for solving the problem of 7-piece chess endings are presented. The algorithms are based on data reordering before compression, the RE-PAIR compression algorithm, and use of the so-called underdetermined value method.


RE-PAIR block compression Lomonosov tables chess endings 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    V. B. Zakharov and V. S. Makhnychev, “A retroanalysis algorithm for supercomputer systems on the example of playing chess,” in Software Systems and Tools, Vol. 11 (MAKS, Moscow, 2010), pp. 45–52 [in Russian].Google Scholar
  2. 2.
    V. B. Zakharov and V. S. Makhnychev, “Creating tables of chess 7-piece endgames on the Lomonosov supercomputer,” Superkomp’yutery, No. 15, 34–37 (2013).Google Scholar
  3. 3.
    N. J. Larsson and A. Moffat, “Offline dictionary-based compression,” Proc. IEEE 88, 1722–1732 (2000).CrossRefGoogle Scholar
  4. 4.
    E. V. Nalimov, G. M. Haworth, and E. A. Heinz, “Space-efficient indexing of chess endgame tables,” ICGA J. 23, 148–162 (2000).Google Scholar
  5. 5.
    G. M. Haworth, “6-man chess solved,” ICGA J. 28, 153 (2005).Google Scholar
  6. 6.
    L. A. Sholomov, “Elements of underdetermined information theory,” Prikl. Diskretnaya Mat., Prilozh., No. 2, 18–42 (2009).Google Scholar

Copyright information

© Allerton Press, Inc. 2016

Authors and Affiliations

  • V. B. Zakharov
    • 1
    Email author
  • M. G. Mal’kovskii
    • 1
  • V. Yu. Shchukin
    • 1
  1. 1.Department of Computational Mathematics and CyberneticsMoscow State UniversityMoscowRussia

Personalised recommendations