Compression of underdetermined data in a 7-piece chess table
- Autores: Zakharov V.B.1, Mal’kovskii M.G.1, Shchukin V.Y.1
-
Afiliações:
- Department of Computational Mathematics and Cybernetics
- Edição: Volume 40, Nº 1 (2016)
- Páginas: 47-52
- Seção: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176119
- DOI: https://doi.org/10.3103/S0278641916010076
- ID: 176119
Citar
Resumo
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.
Palavras-chave
Sobre autores
V. Zakharov
Department of Computational Mathematics and Cybernetics
Autor responsável pela correspondência
Email: victor@ldis.cs.msu.su
Rússia, Moscow, 119991
M. Mal’kovskii
Department of Computational Mathematics and Cybernetics
Email: victor@ldis.cs.msu.su
Rússia, Moscow, 119991
V. Shchukin
Department of Computational Mathematics and Cybernetics
Email: victor@ldis.cs.msu.su
Rússia, Moscow, 119991
Arquivos suplementares
