Author: Bruce Moreland
Date: 19:11:22 08/09/01
Go up one level in this thread
On August 09, 2001 at 17:20:26, Miguel A. Ballicora wrote: >I am doing something different that ends up to be similar in concept. >I do a regular nullmove, but if it fails high, I do not return beta, I just >reduce the depth = depth-(R+1) and do a normal search. >So, you do first a shallow search and then a nullmove. If both fails high, you >cut off. I do a nullmove and then a shallow search, If both fails high I cut >off. I avoid too the problems with zugswangs. Your case might be better in those >cases when the shallow search does not fail high, because you do a search at a >normal depth later. However, in my case I just have to rely on the result of the >shallow search. What does this do to the size of the tree? bruce
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.