Computer Chess Club Archives


Search

Terms

Messages

Subject: Possible refinement to verified null-move

Author: zaid magi

Date: 13:20:21 09/03/04


in verified null-moves, if a null fail-high is detected, we reduce search depth
by one for that ply. my idea is reduce depth by two when a null fail-high is
found, so that tree size will be even closer to standard null-moving, but still
avoiding zugwang stuff.
i have not done any testing yet, but i wanted to see if other members agree that
its a good refinement, or maybe someppl already do that.
lets see what u got to say about this.



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.