Author: Peter Fendrich
Date: 09:08:43 02/01/99
Go up one level in this thread
On February 01, 1999 at 06:27:55, Andrew Wood wrote: >When someone quotes a comparitive speed rating in nodes per second, what exactly >does that usually include ? > >Is it : >a) Generating, doing and undoing moves at non-terminal nodes >...or... >b) Evaluating the terminal node positions using a SEF. >...or... >c) (a) + (b). >...or... >d) something else. > >TIA. > >...Andrew... I know that all programs doesn't count in exactly the same way. I do it like this: For each generated move: I make it on the board and call Node(detph-1,...) In the beginning of the function Node(...) I do cntNodes++ At depth=1, I call the Quiescense function, QNode(...) instead of Node(depth-1,...) In the beginning of QNode(...), in most cases, I call Evaluate(...) After that I do some tests to see if it's worth continuing with the Q search. If not I return. Then I try to generate the first move for this node. If no moves are generated I just return without counting that node otherwise I do cntQNodes++ (I'm not sure if others do the last sequence in the same way...) In the beginning of Evaluate(...) I do cntEvaluate++ To calcualate n/s I do (cntNodes + cntQNodes)/time cntEvaluate isn't included because I don't think Evaluate is a node in the tree. //Peter
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.