Author: Gian-Carlo Pascutto
Date: 09:48:51 12/27/99
Go up one level in this thread
On December 27, 1999 at 12:14:11, Robert Hyatt wrote: > >For me, adding aspiration search here helps significantly. IE start off >with alfabeta(last-X, last+X); > >That (for me) reduces the size of the tree by 10% in the average case, >much more in wild tactical positions. IE a position where there are >zillions of mates, but none are forced. with -inf,+inf, you have to follow >all those mates to their conclusion. With last-X, last+X, you don't... > >Harry had one problem position where -inf,+inf could not ever return a good >score, yet last-X would find the solution very quickly (score was only +2 or >something). I can second that ;) It's even much, *much* worse in bughouse games. There's definetly a gain in *not* researching with a full-window after a fail-high or fail-low. Still, not many programs seem to do it. -- GCP
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.