Author: Ulrich Tuerke
Date: 15:02:36 08/01/02
Go up one level in this thread
On August 01, 2002 at 17:45:33, Dieter Buerssner wrote: >On August 01, 2002 at 09:32:08, Robert Hyatt wrote: > >>On August 01, 2002 at 04:50:23, Martin Bauer wrote: >> >>>Hello all, >>> >>>In want to detect position at the root node, where the best move is _much_ >>>better then all other moves. For Example, only 1 possibility for recapture the >>>quenn. >> >> >>Simple solution. Search the recapture with the window (X,Y). Search >>the _other_ moves with the window (X-q, Y-q) where q is some large >>constant (say 2.00). If the best move is q better than the others, >>the others will _still_ fail low. If one is within q of the best move, >>it will fail high... > >I cannot totally follow here. After searching "the recapture with the window >(X,Y)", you get back a score s. I would then search the other moves with the >window(s-q, s-q+1). > >>Then you have to re-search with a different window, which will cost a lot of >>time... >> > >If you get a fail high here - why research? You already know that it is not an >"easy move". ... because it could be even better than the current best move. Uli > >Regards, >Dieter
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.