Compression of underdetermined data in a 7-piece chess table
- Авторлар: Zakharov V.B.1, Mal’kovskii M.G.1, Shchukin V.Y.1
-
Мекемелер:
- Department of Computational Mathematics and Cybernetics
- Шығарылым: Том 40, № 1 (2016)
- Беттер: 47-52
- Бөлім: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176119
- DOI: https://doi.org/10.3103/S0278641916010076
- ID: 176119
Дәйексөз келтіру
Аннотация
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.
Негізгі сөздер
Авторлар туралы
V. Zakharov
Department of Computational Mathematics and Cybernetics
Хат алмасуға жауапты Автор.
Email: victor@ldis.cs.msu.su
Ресей, Moscow, 119991
M. Mal’kovskii
Department of Computational Mathematics and Cybernetics
Email: victor@ldis.cs.msu.su
Ресей, Moscow, 119991
V. Shchukin
Department of Computational Mathematics and Cybernetics
Email: victor@ldis.cs.msu.su
Ресей, Moscow, 119991
Қосымша файлдар
