Data Compression Using an Intelligent Generator: The Storage of Chess Games as an Example

Abstract Computer chess has been called the drosophila of AI, and currently chess computers are in some sense the most impressive results of AI. In this note we present a robust method of compressing chess master games with help of a fast deterministic chess program. To the best of our knowledge this is the first example where a concrete product of AI is used for data compression purposes.

[1]  H. Jaap van den Herik,et al.  A Data Base on Data Bases , 1986, J. Int. Comput. Games Assoc..

[2]  Ken Thompson,et al.  Retrograde Analysis of Certain Endgames , 1986, J. Int. Comput. Games Assoc..

[3]  Claude E. Shannon,et al.  Prediction and Entropy of Printed English , 1951 .

[4]  Donald F. Beal.  Advances in computer chess , 1986 .

[5]  Daniel S. Hirschberg,et al.  Data compression , 1987, CSUR.

[6]  T. Nitsche,et al.  A LEARNING CHESS PROGRAM , 1982 .

[7]  Jürg Nievergelt.  Information content of chess positions , 1977, SGAR.