Author: Chuck
Date: 15:23:34 05/05/99
Go up one level in this thread
On May 04, 1999 at 23:08:37, Charles L. Williams wrote: >On May 04, 1999 at 22:10:59, Will Singleton wrote: > >>On May 04, 1999 at 22:01:57, Charles L. Williams wrote: >> >>>On May 04, 1999 at 21:46:59, Will Singleton wrote: >>> >>>>On May 04, 1999 at 18:35:50, William H Rogers wrote: >>>> >>>>>I read your post and I don't think that I understand what's wrong. >>>>>I am using a Pent 120 and QBasic (not quick basic) and set maximun depth to >>>>>4 plys. >>>>>From the starting position, white moves e2e4, my program calculated 45,614 >>>>>positions in 40.60156 seconds for a nps of 1140. >>>>>Making a second move of f1c4, the program calculates 60,029 positions in >>>>>54.60938 seconds for a nps of 1111. >>>>>I increment my node counter with every move that the program calculates and >>>>>evauluates. Maybe this is wrong, but I think that one of us is doing something >>>>>not quite correct. Lets try to find out who, what or why. >>>>>Bill >>>> >>>>It's always interesting to know how others count nodes. fwiw, I count all calls >>>>to makemove that result in a legal move. Pseudo-legals aren't counted. >>>> >>> >>> >>>>Will >>> >>>I count any position that is evaluated, but not the moves leading to the >>>evaluated position. >>> >>> >>>Chuck >> >>That's pretty much incorrect, if you are interested in comparing your nps to >>others. But you knew that, right? >> >>I believe most people count a node as a node (or branch) in the tree. >> >>Will > > >I didn't know that, but it explains a few things. I'm a relative newcomer to >this site, so I would have missed any discussions (if any) about counting nodes. > This should improve my count considerably. :) > > >Chuck I think the concern about how many nodes you are counting is only important when you wish to compare your program to other programs. I see no other purpose as to what you count and don't count. But as far as what you SHOULD count is concerned, I'll quote the text "Data Structures in C", Prentice-Hall, 1990 which classifies a node by saying "Each element of a binary tree is a NODE of the tree." This would apply to all "tree" data structures, not just binary trees. For the purpose of testing your program to evaluate your progress (e.g., "how much did my last change slow the program down?"), you may want a counter for each, you could also conditionally compile one or both counters. Hope this helps. Chuck (Wilson)
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.