Author: Frank Phillips
Date: 10:23:02 11/25/98
Bob Hyatt 's response (message 33762) to Bas Hamstra mentioned counting nodes
in the quiescent search correctly. Not sure I understand. How should you
count q-nodes and nodes? I do it like this. Nodes being the thing I report as
the nodes per second performed by the search.
In the Q-search
int Quiescent()
{
pvlength[ply]=ply;
if(ply>=MAXPLY)
return beta;
nodes++;
score=StaticVal();
if(score>alpha)
{
if(score>=beta)
return score;
alpha=score;
}
q_nodes++;
And in the main search:
int ABsearch()
{
if(timeout)
return;
if(ply>=MAXPLY)
return beta;
if(depth<=0)
return Quiescent()
nodes++;
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.