Author: Robert Hyatt
Date: 07:08:16 10/22/00
Go up one level in this thread
On October 22, 2000 at 09:19:43, Alvaro Jose Povoa Cardoso wrote: >Could someone please explain in detail how does the 'rolling id' trick works in >iteractive deepening and hash tables? > >Thank you >Alvaro Cardoso The idea is related to the decision to not clear the transposition table after each new root position is searched completely. You have a global variable "id" that you increment and mod to keep it between 0 and 7. When you store an entry you store this id counter. If you want to store in the table, and the stored id is != the current id, you know this table entry can be overwritten with no further thought since it is from an old search. You keep the old entries around so that they _might_ help you in the current position, but you overwrite them quickly as your search space grows.
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.