Author: Tony Werten
Date: 12:29:36 06/02/01
Go up one level in this thread
On June 02, 2001 at 14:52:56, Rafael Andrist wrote: >I've implemented a Nullmove-heuristic in my alpha-beta-search (full window). But >now the number of nodes in Q-search explodes. Before, the number of Q-nodes was >approximately the double of the normal nodes. Now it's 10x or more. This causes >the problem that I need the same time for the same search depth as before, but I >get a less accurate result. >Is maybe my Nullmove implementation incorrect or is this "normal" and should I >use futility pruning or something similar to reduce my Q-Search? No, there is something wrong. You should get at least 1 ply deeper in the same time. Did you reduce depth with 3 ? ( R=2 and the normal 1 reduction ) Or even 4 ? Did you check not to do nullmove if you have no more depth left ? cheers, Tony > >Thanks > >Rafael B. Andrist
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.