Computer Chess Club Archives

Search

Terms

Messages

Subject: q search nps question

Author: Landon Rabern

Date: 00:56:37 01/07/00

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

Re: q search nps question Tom Kerrigan 04:27:05 01/08/00
Re: q search nps question leonid 17:44:29 01/07/00
Re: q search nps question Robert Hyatt 09:25:46 01/07/00
- Re: q search nps question Landon Rabern 15:45:14 01/07/00
  - Re: q search nps question Robert Hyatt 20:15:53 01/07/00
Re: q search nps question Ulrich Tuerke 08:42:33 01/07/00
- Re: q search nps question Landon Rabern 15:40:50 01/07/00

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.