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.
Get full access to this article
View all access options for this article.