Author: Omid David Tabibi
Date: 06:25:37 11/18/02
Go up one level in this thread
On November 17, 2002 at 22:31:31, Robert Hyatt wrote: >On November 17, 2002 at 21:12:53, Joel wrote: > >>Hey All, >> >>Thankyou to everyone who responded to my query regarding 'extracting bits from a >>bitboard'. I think I will use some preprocessor code and use the bsf/bsr method, >>otherwise falling back on my old method (I can play around with this part >>later). >> >>My next question that follows is how do you guys measure nodes per second. I can >>think of a quite a few ways of doing it myself, but I would prefer implementing >>it in a way which lets me very confidently compare my results with others. >> >>Thanks, >>Joel > > >Every time you recursively call Search() or Quiesce(), increment a counter >by one. That is counting nodes searched. Divide that by time used and you >get a useful NPS value. But when you reach depth == 0, don't increment the node counter, since this node will be counted as a quiescence node upon calling quiesc(). (if you do, this node will be counted twice!)
This page took 0.01 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.