Replacement Schemes and Two-Level Tables

Article type: Research Article

Authors: Breuker, D.M.^{; *} | Uiterwijk, J.W.H.M.^{; **} | van den Herik, H.J.^{; ***}

Affiliations: Maastricht, The Netherlands

Note: [*] Universiteit Maastricht, Department of Computer Science, P.O. Box 616, 6200 MD Maastricht, The Netherlands. E-mail: [email protected].

Note: [**] Universiteit Maastricht, Department of Computer Science, P.O. Box 616, 6200 MD Maastricht, The Netherlands. E-mail: [email protected].

Note: [***] Universiteit Maastricht, Department of Computer Science, P.O. Box 616, 6200 MD Maastricht, The Netherlands. E-mail: [email protected].

Abstract: This note completes the comparison of the performances of seven replacement schemes. The performances are presented as functions of the transposition-table size. Some 200 chess middle-game and endgame positions have been studied. It turns out that the number of nodes of a subtree is a better estimate for potential savings than the depth of a subtree. A two-level table, using the number of nodes in the subtree searched as the deciding criterion, performs best and is recommended. Previous results based on fewer experiments are confirmed.

DOI: 10.3233/ICG-1996-19304

Journal: ICGA Journal, vol. 19, no. 3, pp. 175-180, 1996