Computer Chess Club Archives




Subject: Re: perft question.

Author: Uri Blass

Date: 02:10:17 01/12/03

Go up one level in this thread

On January 12, 2003 at 04:58:34, Joel wrote:

>Hey All,
>When searching the perft tree, would I be right in assuming that if the game is
>over, you simply add one to your counter, and finish searching that node, even
>if it is not at the perft depth?


Perft means the number of games of n moves.

perft(n)=0 if there are no possible games of n moves even if there are possible
games of n-1 moves.


This page took 0.04 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.