Author: Bruce Moreland
Date: 09:28:16 08/13/00
Go up one level in this thread
On August 13, 2000 at 09:43:41, Bert van den Akker wrote: >In my program I define nodes per second as follows: > >Number of calls of the evalation function per second. > >The evaluation function is called in each Qsearch node and >in the nodes which call the Qsearch. > > >Can some people give me the method how they calculate the number of nodes per >seconds in there program. > >Thanks in advance. > >BvdA A node is a node in the tree. It doesn't have to be an end-point. In a conventional program, you can increment node count at top of "search" and at top of "qsearch". If you aren't recursive, or do weird stuff, you can simulate this. bruce
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.