Author: Dan Newman
Date: 01:19:11 07/26/99
Go up one level in this thread
On July 24, 1999 at 03:31:50, TEERAPONG TOVIRAT wrote: >I've studied one source code about hashtable.The author assigns keep method >varialbles as new,old,deep,big1,bigall. I think they are the methods to put >all >informations into the table in case of collision. Their names are arbitrary but >I hope >someone can guess the idea behind them. Please,let me know. >Thanks for any help. >Teerapong These variables have the same names as the various replacement schemes discussed in the paper "Replacement Schemes for Transposition Tables" by D.M. Breuker, J.W.H.M. Uiterwijk and H.J. van den Herik (1994). It was published in ICCA Journal, Vol. 17, No. 4, pp. 183-193. You can also find it in postscript (and compressed .Z) at http://www.cs.rulimburg.nl/~breuker as well. IIRC, the article came to the conclusion that a two level transposition table might be best, where one level uses a depth based replacement scheme and the other is always replace. Anyway, it's a rather good article. -Dan.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.