Author: Richard Pijl
Date: 02:09:08 03/21/04
Go up one level in this thread
On March 21, 2004 at 03:18:13, Michael Henderson wrote: >Right now, im storing the PV using dynamic arrays in the search. I would like >to switch to collecting the PV using the hash table after the search has >finished, but are there any possible problems with the method? I used to fetch my PV from hash too, but I am not doing that anymore: I switched back to a triangular pv array. I'm getting longer PV's to print now (and still use hash entries to lengthen the PV when the PV in the array stops due to hashtable cutoffs). Shorter PV's have a somewhat bad influence on move ordering so the penalty for copying the pv arrays is compensated for. I see no reason to replace your arrays with hashtable retrieved PV's unless you have no alternative (i.e. MTD(f)). Richard.
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.