Author: leonid
Date: 09:34:23 02/25/02
Go up one level in this thread
On February 25, 2002 at 08:20:25, Benny Antonsson wrote:
>Hi !
>
>I have a question about how to count the nodes when using alphaBeta and
>quiscense searching. Here is what we do (pseudo code):
>
>function alphaBeta()
>{
> nodeCount++;
>
> value = quisce();
>}
>
>function quisce()
>{
> nodeCount++;
>}
>
>Wouldn't this result in counting the first quisce-node twice ??
I am not sure about how it must be said in C, since it is not my language but my
way of counting nodes is simple. Only nodes that were used in finding best move
for each ply will be counted and nothing more. For instance, in ply six 35 legal
moves were generated but only four used for finding best move (or value).
Counter then will add only 4 nodes and will forget about other 31.
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.