Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Aspiration search

Author: Dave Gomboc

Date: 07:08:23 04/21/99

Go up one level in this thread


On April 21, 1999 at 09:24:43, William H Rogers wrote:

>It is when you set a window of plus or minus a pawn or a part of a pawn.
>Anything that falls outside of the window is rejected, thus a faster search by
>eliminating less that optimum moves. Sometimes, if the window is to large, you
>end up having to research the whole tree in order to find a better move.

Rather, if the window is too small: and not the whole tree, just the "high side"
or the "low side".  It is even possible to do multiple aspiration searches, e.g.
mtd(f).

Dave




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.