Author: Ricardo Gibert
Date: 18:30:51 07/06/03
Go up one level in this thread
On July 06, 2003 at 19:41:56, Federico Corigliano wrote: >In my chess program I'm using a single transposition hash table. When I will >store info it, and already are info on it for the position, I check if the info >in the table has a smaller depth. If this is correct, I replace it with the new >info. >I saw that other people use two transposition hash tables: one "always replace" >and other with a "special replace scheme". >What's the difference between the "special replace scheme" and the system that I >use? >How much in the improvement using two hash tables, one with "always replace"? > >Thanks You may want to check out Dennis M. Breuker thesis (Chapter 2) at: http://www.breuker.demon.nl/thesis/index.html
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.