Author: James Swafford
Date: 19:36:35 08/17/01
Go up one level in this thread
On August 17, 2001 at 15:16:54, Alvaro Jose Povoa Cardoso wrote: >Only now I've implemented the trick of avoiding generating any moves by >searching the hash move first (if there is one) and bailing out early if this >move causes a fail high. >Now, I just don't get the same node counts. I get tree size reductions. >This is a bug right? >I should get exactly the same node count, just a litle faster right? You're not searching the same tree, so why should you get the same node count? I would expect something close, but not the same count. -- James > >Help appreciated, >Alvaro Cardoso
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.