Author: Antonio Dieguez
Date: 11:02:52 02/10/03
Go up one level in this thread
On February 10, 2003 at 12:57:38, Charles Roberson wrote: > My first experiements were using the adjustments at the root of the tree. > So, min and max not needed as alpha and beta are -infinity and +infinity. > > However, min and max are needed in the depths of the search. My second post > refers to performance achieved with the adjustment in the depths and the > root of the search. So you weren't using Aspiration Search at the root? for many of us aspiration search reduce node count a bit. Personally I go to +infinity in just three steps (counting the first search, so it shows two times a ! before the last search of the move), if I remember well, at least a version of Comet uses a lot of steps of 0.25 size, etc. At the root the idea of use a lower bound bigger than alpha+1, I have never used it, but I will try today for fail-lows if I am not lazy, I think am so improductive.... I also remember mentioning something of that by the author of Smarthink. Also I suposse is better to do your last if in two ifs to use two smaller windows.
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.