Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Iterated search vs. Internal iterative deepening

Author: Daniel Clausen

Date: 03:11:29 06/21/02

Go up one level in this thread


On June 21, 2002 at 05:52:11, Gian-Carlo Pascutto wrote:

>On June 21, 2002 at 05:47:38, Daniel Clausen wrote:
>
>>When Crafty (and other engines) don't have a a move from the HT and want to
>>search N plies, they first make a search of N-2 (or something similar) and try
>>to get a move this way. Of course the search for N-2 plies will again don't have
>>a HT-move, because it's the same position. So this search will try a N-4 search
>>first, and so on.. internal iterative deepening :)
>>
>>[Please someone correct me if I'm wrong here :)]
>
>Hmm, wouldn't what you descibe degenerate into nothing?
>
>--
>GCP

I skipped the break condition, which of course is a bad thing to do when trying
to explain something. Sorry about that:) But I would assume that as soon as the
ply-number gets negative (or HUGE positive, grins) one would stop with it and
just do a regular search w/o a hash move.

Sargon



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.