Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: q search nps question

Author: leonid

Date: 17:44:29 01/07/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?
>
>Thanks,
>
>Landon W. Rabern

I am a little bit lost in the wording, like q-search, but my counting is simple.
I count only those moves, inside of each ply, that were "deposed on the board"
in order of finding the evaluation for given move.

Evaluation include in itself immidiate value of deposed move (how much deposed
piece take by killing the ennemy piece, or because of the promotion of pawn)
minus value that ennemy obtain in given number of plys in its response.

Leonid.



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.