Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: depth 24 in 96 hours

Author: Gian-Carlo Pascutto

Date: 02:51:50 08/22/02

Go up one level in this thread


On August 22, 2002 at 02:22:21, scott farrell wrote:

>I found 'internal iterative deepening' helped that problem in my program. I
>wonder if gandalf does not use IID.

Have you tested the behaviour of your program in 24 ply searches?

--
GCP



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.