Abstract
In the first part of this contribution we show how the theory of error-correcting codes can be used to compress the encoding of chess positions for use in a transposition table. In the second part we show how the use of a transposition table introduces inconsistencies into an alpha-beta search. One inconsistency can be removed by respecting the bounds found in the table.
Get full access to this article
View all access options for this article.