Author: Richard Pijl
Date: 05:51:53 06/21/04
Go up one level in this thread
On June 21, 2004 at 07:57:15, Jaime Benito de Valle Ruiz wrote: >Would it be a good idea to store an entry with the game move at the root of the >search? The idea, of course, is to use it to determine whether a hash entry >belongs to a previous search, and it probably should be replaced even if it has >a higher number of nodes/depth because it could have become obsolete. >I think some engines actually set a flag for every hash entry before or after >every search to mark them as "old", but this doesn't sound like a good idea for >quick games if you want to use a lot of hash. >Any suggestion/comments? Instead, add a sequence number of the search (e.g. the n;th time the search is started) to the hash entry. On the next search, the sequence number will be incremented by 1. By comparing actual sequence number and stored number (in the hash entry) you can determine if an entry is expired or not. Richard. >Thanks, > > Jaime
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.