Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Yet Another Null move question...

Author: David Rasmussen

Date: 00:11:32 12/22/00

Go up one level in this thread


On December 21, 2000 at 21:45:52, Robert Hyatt wrote:

>On December 21, 2000 at 21:29:02, Dann Corbit wrote:
>
>>Has anyone tried this:
>>
>>Exhaustive search (NO Null move pruning) out to some arbitrary ply from the root
>>{e.g. ply 5} and then increasingly aggressive Null move pruning forward from
>>there [perhaps with a linear increase in aggressiveness out to some level]
>>?
>
>
>I do something similar.  In endgames where there is less than a queen, but
>one side still has pieces, I don't do null move for the first N plies of
>the search.
>

I can't see that anywhere in your code. Help! :)

>I also do a graduated null-move search, where R=3 for positions near the root,
>and R=2 for positions near the leaf positions.  I think doing the inverse is
>wrong, as you will hide too much by letting null-move collapse the last few
>plies into a simple quiescence search...

This I can see.



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.