Author: Daniel Clausen
Date: 07:11:48 07/27/01
Go up one level in this thread
Hi On July 26, 2001 at 17:51:01, Artem Pyatakov wrote: >I was looking at the source codes of Gerbil and Crafty and noticed that they >handle the following problem differently: as part of the iterate/think loops >both programs try to force their program to search the PV nodes from the >previous iteration first, which makes sense, but the implementation of this is >very different. > >Gerbil just saves the PV into a separate array, while Crafty saves the PV into >the hash table. I use neither and just hope that the hashtable already contains the PV. I think that the chance that the PV is already overwritten is pretty high though. (that would explain my rather big search trees compared to other engines) Regards, Sargon
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.