Author: Vincent Diepeveen
Date: 02:55:44 06/13/98
Go up one level in this thread
On June 12, 1998 at 12:38:12, Don Dailey wrote:
>On June 12, 1998 at 03:49:36, Vincent Diepeveen wrote:
>
>>Hello,
>>
>>Some time ago someone mentionned Deep Search extensions.
>>I looked in archives but could not find anything about it.
>>
>>What exactly are deep search extensions,
>>is it extending after the n-th extension more and more?
>>
>>Greetings,
>>Vincent
>
>Hi Vincent,
>
>Deep search extensions are a by-product of the null move search.
>Essentially they are extensions given when the program fails a
>null move search. The assumption (when this happens) is that
>something interesting must be going on (it's usually just some
>direct attack of something) and warrants an extension.
>
>The typical implementation is to only grant this on 1 or 2 levels
>near the leaf nodes of the main search.
Doesn't this mean we extend everything, because we get again
leafs after we extend?
Are there extra conditions like score of position static evaluated
eval >= alfa, or does the definition leave that free?
So
if( nullmovefail && eval >= alfa )
then extend a ply.
>- Don
This page took 0.01 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.