Abstract
The vast majority of chess-playing programs make use of a transposition table to store positions and their associated values. Typically (and especially with very fast processors or relatively small memories) only a fraction of the values encountered can be stored. This article examines the performance of a simple multiple-probe scheme, using varying table sizes, on a number of middle-game positions. Multiple probes of the table are shown to perform significantly better than the standard single-probe implementations.
Get full access to this article
View all access options for this article.