Data Compression in Encoding Chess Positions

Article type: Research Article

Authors: Balkenhol, Bernhard^{; *}

Affiliations: Universität Bielefeld, Bielefeld, Germany

Note: [*] Universität Bielefeld, Fakultät für Mathematik, Postfach 100131, 33501 Bielefeld, Germany. E-mail: bernhard@mathematik.uni-bielefeld.de

Abstract: We sketch an algorithm encoding realistic chess positions by the one-bit answers to a sequence of yes-no questions, where realistic is roughly synonymous with ‘lightly’ to occur in a master game. Test runs suggest that a sequence of 79 bits is required on the average for such a position to be encoded, of which process one example is given.

DOI: 10.3233/ICG-1994-17303

Journal: ICGA Journal, vol. 17, no. 3, pp. 132-140, 1994