Author: Landon Rabern
Date: 15:40:50 01/07/00
Go up one level in this thread
What is "lazy evaluation"? Landon On January 07, 2000 at 11:42:33, Ulrich Tuerke wrote: >On January 07, 2000 at 03:56:37, Landon Rabern wrote: > >>I jsut added a q-search to my program and it dropped from 180,000 nps to >>90,000 nps. I count leaf nodes when counting my nodes, so I though it might be >>that the q-search has no leaf nodes, so I was not getting these free no-work >>nodes. This wasn't it though, because I tried incrementing the nope counter >>where a leaf node would have been had it been a regular search, but this only >>improved it slightly. I am pretty sure that it is actually running a lot >>slower. Is it supposed to do this? >> >>Thanks, >> >>Landon W. Rabern > >I think that it is our standard to count all nodes when determining the nps (not >only leaves). The question is, what are you doing in q-search ? If you use for >instance some kind of "lazy evaluation", I'd expect the nps to increase after >having implemented the q-search because only a part of the q-nodes will be >inside your evaluation window. >In case you have a full static evaluation for all leaves (i.e. depth <= 0) and >you are counting leaves only, I could very well imagine that your nps decreases >a bit because the ratio (#leaves)/(total # nodes) will increase, and you have to >evaluate a lot of nodes more. > >Uli
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.