Compressing a Chess-Endgame Database
Abstract
A method of compressing a chess-endgame database taking advantage of the arrangement of the number of moves-to-mate between adjacent positions within the database is described. A subset of KQK with White to move (WTM) is used to illustrate the technique.
