Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question about engines and their calculating speed

Author: h.g.muller

Date: 08:26:07 02/06/06

Go up one level in this thread


Node counting can be ambiguous, depending where in the program one does the
counting. In my engine I count a node when I start generating moves, i.e. after
that it turns out that the hash table result is not sufficient to provide the
answer. But after that, even in an end leaf, the engine still goes through all
the moves, to decide if the position they would reach is sufficiently different
from the current position to warrant deeper searching of that move. This
decision might depend on evaluation terms, like material, after the move (i.e.
it takes into account what the move itself captures). So it is a matter of taste
if you want to consider the positions after the moves the true end leaves, and
count them as well. This might drive up the node count by an order of magnitude.
Counting hash-table hits also as a node could also make an appreciable
difference...



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.