Author: James Swafford
Date: 11:26:32 09/18/02
Go up one level in this thread
On September 18, 2002 at 11:47:53, Severi Salminen wrote: > >>>I guess I meant, do you count nodes in makemove, or in calls to search and >>>qsearch? I do makemove, and my contention is that nodes aren't analogous if >>>counted the other way. I think that some folks count nodes in which makemove >>>isn't actually called, thus inflating the node count. >> >>I must be one of those folks. :) I count nodes on entry to >>Search( ) (except when depth==0), and qnodes on entry to QSearch( ). >>My final report is the sum nodes+qnodes. > >I was once also like you are now, but I evolved :) So, the most common method is >to call only nodes called _from_ qsearch as qnodes. Not the first node when you >enter qsearch. So don't increase qnodes at the start of qsearch but only after >you call qsearch _again_ in qsearch. The logic (I believe) to call a node a >qnode is that a qnode is no longer 100% secure -> ie. that position was reached >excluding normal moves. Or maybe I define a qnode as a node at which the children come from a limited qsearch OR the node is a leaf. :) There are no standards, I'm afraid. -- James > >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.