Author: Stuart Cracraft
Date: 10:14:36 09/06/04
Go up one level in this thread
On September 06, 2004 at 11:23:23, Richard Pijl wrote: >On September 06, 2004 at 10:48:00, Stuart Cracraft wrote: > >>On September 06, 2004 at 04:47:12, Alessandro Scotti wrote: >> >>>On September 05, 2004 at 22:12:35, Stuart Cracraft wrote: >>> >>>>I walk the PV until there is no further position. No limit. This can then >>>>either be left in the hash table if you don't clear between searches >>>>but like Bob, you should keep the PV entries and restore them in the >>>>hash table before the next search whether or not you table-clear due to >>>>potential changes. >>>> >>>>I don't do this. It's a simple fix. I don't know why I've delayed putting >>>>it in. >>> >>>I don't either. But since I get my PV from the hash table, it's already there. >> >>Mine is already in there as well so I don't see why Bob said to >>store it in the hash table after the last iteration unless Crafty uses >>some different method to record the PV and has to store it in the hash >>table prior to the next iteration. Why wouldn't it be in there already? >>Does Crafty clear the hash table between moves? > >Reinserting (from a PV array) makes sure that the whole PV is in there for the >next search. The PV positions could have been overwritten by other positions. >Richard. But if you got it originally from the hash table in the first place at the end of the last iteration, then they may already have been overwritten. You would have to use an alternate method like triangular array to store them, away from hash, then access that array and fill hash from it prior to new iteration.
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.