Multiple Probes of Transposition Tables

Article type: Research Article

Authors: Beal, D.F.^{; *} | Smith, M.C.^{; *}

Affiliations: London, England

Note: [*] Department of Computer Science, Queen Mary and Westfield College, University of London, Mile End Road, London E1 4NS, England E-mail: [email protected].

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.

DOI: 10.3233/ICG-1996-19404

Journal: ICGA Journal, vol. 19, no. 4, pp. 227-233, 1996