Author: Uri Blass
Date: 05:51:01 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 do not do it in this way.
I have nodes++; in my program every time that I make a move.
I do not need to have 2 places in the program when I do nodes++ when one is
enough.
tscp does it in that way but it does not count qnodes twice
It increases the nodes by 1 only after checking that it does not need to call
qsearch.
Uri
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.