Author: David Rasmussen
Date: 16:25:57 01/15/03
Go up one level in this thread
On January 15, 2003 at 19:11:43, Nathan Thom wrote: > >So, do you assume none of the entries have been overwritten, because at the end >of a search you update the hash table again just to make sure the best move is >there? If you just probe the hash table to get the pv, sometimes entries will have been overwritten, and you can't retrieve the full pv. But if you keep track of the pv by other means (a classic pv array), you can store that in the hashtable at the end of an iteration. You can still experience a hash hit when searching the pv. If this happens, you wont have the full pv, you will miss the part after the hash hit. /David
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.