Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Programmers Question: Hashing and Alpha/Beta bounds

Author: Tord Romstad

Date: 04:09:33 06/08/05

Go up one level in this thread


On June 07, 2005 at 13:45:23, Dieter Buerssner wrote:

>The 99.9999% first looked like an exaggeration to me (it is one, for normal
>engines doing say a not too long search, but I won't discuss how many digits 9
>there really should be - the intend of the message is clear). So, I thought
>count the nodes (I did not count qsearch nodes). I always use the zero window
>from the second move onwards here (no other preconditions). For a depth 12
>search of the start position I got:
>
>pv nodes 516, non pv nodes 5390768 99.9904% researches 246
>
>This was about one minute (most nodes are not shown, because they are in
>qsearch, where I don't use the PVs algorithm, either). researches is the number
>of times, the engine had to do a research inside the tree, because score was >
>alpha and < beta, and the first search was done with zero window. Doesn't sound
>516 pv nodes too small? Can anybody try with his engine?

OK.  Here is what I get for a 14 ply search from the initial position:

PV nodes: 2,234  Non-PV nodes: 15,193,446  99.985296%

Not too different from your numbers.  My slightly higher PV node percentage
can perhaps be explained by the fact that the best move at the root changed
many times in the first 14 plies.

Tord



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.