Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: An improvement to null move search

Author: José Carlos

Date: 02:11:44 04/07/04

Go up one level in this thread


On April 07, 2004 at 04:23:12, Tord Romstad wrote:

>On April 07, 2004 at 04:17:43, José Carlos wrote:
>
>>On April 07, 2004 at 04:06:38, Tord Romstad wrote:
>>
>>>The following idea is still untested, but unless I am missing something it
>>>is guaranteed to reduce the number of nodes without any risk.  The idea is
>>>fairly obvious, and I am sure some of you are already using it, but I still
>>>don't think it is widely known.
>>>
>>>At a node where the remaining depth is sufficiently big that a null move
>>>would not drop us directly into the qsearch, and beta > DRAW_SCORE, avoid
>>>doing a null move search if the move leading to the node was a reversible
>>>move.  The point is that we know that the null move search is a waste of
>>>time in this case.  After the null move, the opponent can just reverse
>>>his move, with a repetition draw score.
>>>
>>>Tord
>>
>>  Maybe I don't understand you correctly, but I think side-to-move changes so no
>>repetition occurs. White to move, I play Ng1f3, you null-move, I play Nf3g1, but
>>now it's black to move.
>
>Yes, yes, you're right.  I was stupid, as usual.  :-(
>
>Tord

  You share your ideas, and that's great. Keep doing so please. Even if you make
a mistake, you:
  -get feedback and avoid useless developing+testing
  -give something interesting to think about
  Congratulations on your success with Gothmog. Really impressive how your
"stupid" ideas are working on your program. I wish I was so "stupid" as you.

  José C.



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.