Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Iterative Deepening

Author: John Coffey

Date: 18:19:45 09/20/98

Go up one level in this thread


On September 20, 1998 at 20:49:52, Robert Hyatt wrote:

>
>there's no sense in doing it repeatedly, because if you do, you research
>too many nodes to the same depth. (think about it).

Yes, this I understood.

>
>But, at times, this is useful, and is called "internal iterative
>deepening."  If, on the PV search at the next iteration, I can't find
>a hash move at any level, I do just what you suggest to find the best
>move to try there first...  and it saves a good bit of time here and
>there...

The last time I wrote a chess program it was 1987, and that was with
limited information available to me.   So sometimes the terminology
has me confused even if I understand most of the concepts.  So what
is "PV?"

Thanks again,

John Coffey



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.