Author: Severi Salminen
Date: 13:16:23 02/23/01
Go up one level in this thread
On February 23, 2001 at 13:13:42, James Swafford wrote: >On February 23, 2001 at 11:19:20, Rafael Andrist wrote: > >>How is nodes per second defined (or what is usually meant)? Are all nodes >>included, or is it without quiescent nodes? Is the hash table disabled to >>measure this value? >> >>Rafael B. Andrist > >Most folks try to count interior, frontier, and quiescent nodes. >You can measure this by entrances to the search / qsearch functions, >or by make, etc. > >I don't think there's a concrete definition, which makes comparison >between programs meaningless. Well I think that the most of chess programs count all visited nodes - there is not too much to interpret on that one. So whenever we enter a "new" node we increment a counter. The biggest difference is probably whether to count the root node or not... Of course there might be programs calculating the first qnodes twice (incrementing at the beginnig of search() and then again in qsearch()), but there is no way to find that out, except when NPS rate is very high ;) Severi
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.