Author: Alessandro Scotti
Date: 03:53:44 09/07/04
Go up one level in this thread
On September 06, 2004 at 18:33:47, Robert Hyatt 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. > > >It won't _always_ be there . That is the problem. You can overwrite a key >position and lose a move in the PV, and hence the _rest_ of the PV will not be >useful. Yes I know, but for the moment it has to do. Later, I plan to implement a separate function for the root moves and a triangular PV array. In the meanwhile however I had to consider more carefully what gets stored in the hash table and how, and that has been a useful experience IMO.
This page took 0.01 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.