Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question about iterative deepening

Author: Robert Hyatt

Date: 18:57:46 07/29/03

Go up one level in this thread


On July 29, 2003 at 21:11:23, Mathieu Pagé wrote:

>Hi,
>
>I have this question about iterative deepening:
>
>When I have search a position at, let say, 8 ply and i had searched half of the
>moves at ply 9 and none of those move return a better score than the best move
>at 8 ply wich move should I choose ? The best at ply 8 or the best at ply 9 even
>if I have not search all moves ?
>
>someone have an hint ?
>
>Thanks for your help.
>
>Mathieu Pagé


You have two choices.

1.  If you don't get a best score at depth=N, that means that the score
is going to be _lower_ than at the previous (depth=N-1) iteration if you
are using an aspiration window.  (if you are not, this is impossible so I
assume you are).

2.  After the _first_ move fails low, you can relax the alpha value and
search it immediately again, rather than trying to search all the moves
first.

I use approach 2 at the present, although I have used approach 1 many years
ago (20+).






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.