Author: Daniel Clausen
Date: 11:40:52 09/06/99
Go up one level in this thread
Hi On September 06, 1999 at 10:09:57, Bas Hamstra wrote: >On September 06, 1999 at 07:41:01, blass uri wrote: > >>On September 06, 1999 at 07:05:03, blass uri wrote: >> [snip] >Another thing is: the natural way to count nodes is to put a nodes++ in the >search and in the qsearh. But then you double count the leafs of the normal >search (same node, same depth in search and qsearch). This nodes++ is exactly what I'm doing in my program. And to avoid to double count nodes in search and qsearch twice i have an "if(ply==maxPly)..." where maxPly is the depth of the non-q-search. Of course the if slows the program a bit but then, i want to calculate #nodes and not some other obscure number i can't reaplly explain. :) >But: does it make sense to compare NPS between programs? Suppose one program >uses SEE pruning and the other program not. Now the program without SEE will >have a higher NPS. But does this comparison make any sense? The comparison surely makes sense. It's just that the conclusions some people make don't make sense... cu, -sargon
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.