Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: null-move vs non-null-move

Author: Uri Blass

Date: 00:30:18 10/10/02

Go up one level in this thread


On October 10, 2002 at 03:05:28, Tony Werten wrote:

>On October 09, 2002 at 23:06:48, Robert Hyatt wrote:
>
>>
>>
>>I had to stop the experiment sooner than I wanted, but I did find some
>>interesting things out.
>>
>>1.  at _very_ fast time controls (40 moves in 1 minute) null-move completely
>>destroys non-null-move
>>by a ridiculous margin.  (this ended something like 60 wins, 5 losses, 8 draws)
>>
>>2.  At longer time controls (40 moves in 10 minutes) non-null-move catches up
>>somewhat.  It still loses
>>far more than it wins, but not _nearly_ so bad as test 1.  (this was closer, but
>>with fewer games played)
>>
>>3.  At 40 moves in 60 minutes, things close up even closer as the data I
>>previously posted shows.  The
>>margin ended up at 13.0  /  22.0 in favor of null-move. (null won 8, lost 4,
>>drew 10)
>>
>>4.  I wonder what would happen at longer time controls.  Note that these were
>>run on 550mhz processors, going to cpus 4x faster might close the gap even
>>farther...
>>
>>food for thought...
>>
>>I don't know what 13/22  turns into, rating wise,  18/24 would be +200, so this
>>is significantly less than
>>+200 overall.
>
>Can't say I'm suprised. If nullmove gives 2 ply (wich is what is generally
>accepted ) then you're basicly doing (n vs n+2) matches wich get less unequal
>with bigger n.
>
>Tony

The difference in the depth is not constant unless you do
non recursive null move pruning.

I posted 2 examples in Fritz when null move gave 3 and 5 plies.
The real difference is smaller because null move does mistakes
but it is also the case at smaller depthes.

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.