Author: Martin Giepmans
Date: 14:12:02 09/03/04
Go up one level in this thread
On September 03, 2004 at 16:20:21, zaid magi wrote: >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. Many engines do this is the endgame and some also in the middle game. Some programmers reduce the depth with 3 or even more. This is usually called "verification search" and it's an old technique. Martin
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.