Email this article Compression of underdetermined data in a 7-piece chess table
- Authors: Zakharov V.B.1, Mal’kovskii M.G.1, Shchukin V.Y.1
-
Affiliations:
- Department of Computational Mathematics and Cybernetics
- Issue: Vol 40, No 1 (2016)
- Pages: 47-52
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176119
- DOI: https://doi.org/10.3103/S0278641916010076
- ID: 176119
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
Keywords
About the authors
V. B. Zakharov
Department of Computational Mathematics and Cybernetics
Author for correspondence.
Email: victor@ldis.cs.msu.su
Russian Federation, Moscow, 119991
M. G. Mal’kovskii
Department of Computational Mathematics and Cybernetics
Email: victor@ldis.cs.msu.su
Russian Federation, Moscow, 119991
V. Yu. Shchukin
Department of Computational Mathematics and Cybernetics
Email: victor@ldis.cs.msu.su
Russian Federation, Moscow, 119991
Supplementary files
