Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: negative extensions

Author: Uri Blass

Date: 06:49:02 01/25/01

Go up one level in this thread


On January 25, 2001 at 09:34:05, Robert Hyatt wrote:

>On January 25, 2001 at 08:20:26, David Rasmussen wrote:
>
>>Howdy.
>>
>>Inspired by the thread on extensions, I was wondering whether the idea of
>>negative extensions or reductions could be a good one.
>>
>>I mean, maybe many of the "unsound" pruning methods would be sounder if, instead
>>of just pruning, they just adjusted the resulting depth down. In that way, a
>>line would still be examined, only later.
>
>
>This is what null-move search does, in essence...

Not exactly.

I know that some programs cannot solve mate in 2 when it is not a problem of
depth because they are null movers.

Null move is used also only in cases when there is no threat and the idea of
negative extensions can be used also in different cases so the idea of negative
extensions seems to be more general.

Uri



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.