Computer Chess Club Archives

Search

Terms

Messages

Subject: Help needed: too many Q-nodes after implementing Nullmove

Author: Rafael Andrist

Date: 11:52:56 06/02/01

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?

Thanks

Rafael B. Andrist

Re: Help needed: too many Q-nodes after implementing Nullmove Tony Werten 12:29:36 06/02/01
- Re: Help needed: too many Q-nodes after implementing Nullmove Rafael Andrist 11:59:13 06/03/01
  - Re: Help needed: too many Q-nodes after implementing Nullmove Tony Werten 01:12:14 06/04/01

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.