Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Iterative Deepening

Author: Pat King

Date: 06:03:45 09/22/98

Go up one level in this thread



On September 21, 1998 at 17:58:23, Tom Kerrigan wrote:

>Iterative deepening might be a wash at 4 ply, but I would not like to start a 10
>ply search with an empty PV array/hash table/history array.
>
>-Tom

Yes, but if you're not doing ID, you wouldn't clear out the data from previous
searches,
but use it to give you pretty good ordering.  Certainly a deep search with
-ZERO-
move ordering would be painful, but  you've still n-1 or 2 deep data from the
last move.
It seems ID throws that all away.

Pat



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.