Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Starting position to 30 ply

Author: Vincent Diepeveen

Date: 15:49:19 06/04/01

Go up one level in this thread


On June 04, 2001 at 04:35:19, Uri Blass wrote:

>On June 04, 2001 at 03:36:25, Rudolf Huber wrote:
>>Actually 30 ply was reached after 2:41 hours.

>>
>>SW: no search extensions, normal nullmove pruning, normal quiescence
>>    search
>>HW: 2xCeleron 466 MHz, 500 MByte Hash
>>
>>
>>Can anyone do better?
>Some questions:
>
>1)Is normal null move pruning recursive or not recursive null move pruning?
>In other words is it possible that your program will miss something that is 15
>plies when it searches 30 plies not because of zunzwang.
>
>2)What is the result without null move pruning?
>It will be interesting to compare your results with Deeper blue depthes in the
>positions from kasparov-deeper blue games.

I'm using PVS in diep, NOT mtd.

I'm generating numbers for you now with next searches
  a) only nullmove (already done) and no extensions and WITH hashtable
  b) (running now) FULLWIDTH, no extensions, and WITH hashtable

Next tests
  c) FULLWIDTH, no extensions, no hashtable last 6 plies
  d) FULLWIDTH, check extensions,
     recapture extensions + singular extensions,
     no hashtable last 6 ply.

b + c are interesting for b.f. reasons.

d for a real compare with deeper blue, but it won't get deep i fear.



>3)I see that you get depth 1 with only 2 nodes
>
>I guess that the tree include only the following 2 positions
>the beginning position and the position after h3.
>
>Am I right?
>
>I guess that you use the qsearch at the last ply because you do not need to
>generate all the moves in the last ply but only captures when your evaluation is
>only material evaluation.
>
>4)How do you get 45 nodes at depth 2?
>
>I see that the tree is very small and even at depth 3 you get only 138 nodes.
>Can you post the full tree for the first depthes.
>
>I think it may be productive for people to understand exactly what is the
>algorithm that your program use.
>
>I prefer to look at things by examples and not by formal definitions that may be
>more complicated.
>
>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.