Compression of underdetermined data in a 7-piece chess table
- 53 Downloads
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.
KeywordsRE-PAIR block compression Lomonosov tables chess endings
Unable to display preview. Download preview PDF.
- 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.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
- 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.G. M. Haworth, “6-man chess solved,” ICGA J. 28, 153 (2005).Google Scholar
- 6.L. A. Sholomov, “Elements of underdetermined information theory,” Prikl. Diskretnaya Mat., Prilozh., No. 2, 18–42 (2009).Google Scholar