Author: Pat King
Date: 09:53:03 08/29/01
Go up one level in this thread
On August 29, 2001 at 08:58:41, Andrew Williams wrote: >On August 29, 2001 at 08:25:26, Pat King wrote: >>Yes, of course Zotron tests the legality of hash moves within the search. My >>assumption has been that the hash entry for the root position must always be >>valid, and this is the way I've passed my engine's move back to the calling >>functions. Works 99.999% of the time, and fails spectacularly 0.001% of the >>time. I've had a devil of a time catching that 0.001%. >> >>Pat > >Ahhh. I see. Mine also uses the hash table to construct its PV. > >Did you catch your error? > >Andrew I can't reproduce it consistently, which is what caused me to come up w/ the mtd/pvs idea, using the pv[][] structure to bypass the hash. Nobody seems to think it's a good idea for performance. I haven't yet decided if it might be useful for debugging. Pat
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.