Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Null move generalization

Author: Tom Likens

Date: 10:52:32 04/18/02

Go up one level in this thread



Hello Vincent,

What exactly is a double nullmove?  I'm guessing, without any evidence,
that you are performing two null moves in a row (i.e. allowing both sides
to pass on their move, while reducing the depth of the search by 2x what
a normal nullmove reduction would equal).

Correct, incorrect??  I'd be interesting in hearing your thoughts (or
reading them would be fine also ;)

regards,
--tom


On April 18, 2002 at 09:40:00, Vincent Diepeveen wrote:

>On April 17, 2002 at 15:43:23, Jesus de la Villa wrote:
>
>With a correctly implemented double nullmove the insight
>is easy to see that there is not a single position which
>double nullmove cannot solve.
>
>Normal nullmove on the other hand possibly cannot even solve
>a single zugzwang (which is it's *only* drawback), because
>it always allows one side to not move in a position X.
>
>Therefore double nullmove has no drawbacks when in a game
>where doing nothing is in the overwhelming case bad.
>
>Note that a good definition of zugzwang is a position where
>playing *any* move is bad for the side to move.
>
>>
>>Have someone defined the general rule(s) where null move
>>is unable to find simple combinations?, and if so, which
>>are those rules ?
>>
>>"Obviusly" is more expensive to check it than to not
>>use Null Move.
>>
>>Thanks for asking
>>
>>
>>
>>PS. I hope you undertand my poor English :)



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.