Author: Tom Kerrigan
Date: 04:27:05 01/08/00
Go up one level in this thread
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? A simple and [usually] correct way to count nodes is to increment the node counter in your makemove() function. The 100% effective method to see what's slowing down your program is to profile it. Profile it with and without the q-search and see what changes. If the reason isn't obvious, at least you have more information about the problem to post here. BTW, allowing king captures is not a silver bullet. IMHO, it's tricky to implement and it will not give you an amazing performance increase. (I would be surprised if it gives you more than 20%.) My program tests each side for check at every ply, and it still searches 150,000-250,000 NPS (K6-2/350). -Tom
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.