Author: Robert Hyatt
Date: 09:53:03 12/23/00
Go up one level in this thread
On December 23, 2000 at 03:41:51, Gian-Carlo Pascutto wrote: >On December 22, 2000 at 15:58:17, Ernst A. Heinz wrote: > >>I still wonder what, in particular, "Junior" uses the null-move >>score for which it seems to calculate for the root node _itself_. >> >>Any ideas? >> > >You could, for example, compare the score from this nullmove >search to your inital beta window, and if it is higher, >immediately quit your search and increase your window, thereby >avoiding a full fail-high+research. > >-- >GCP I don't know if that would work. Such a null-move search _must_ fail high, or else you are winning. Because you just let the opponent play two moves in a row, and if he can't win with that advantage, something is up. I don't think you can use the score returned by null-move to set the initial aspiration window for that reason. It might be interesting to detect a dangerous zugzwang situation... Because if the null-move search returns a better score for you than making a real move does, you have a problem...
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.