Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question on RootSearch

Author: Bas Hamstra

Date: 02:32:04 09/08/99

Go up one level in this thread


On September 07, 1999 at 22:52:10, William Bryant wrote:

>I was reviewing my code, and noted in the root search when the score obtained
>is > alpha (and < beta) I was doing the following:
>
>alpha = score;
>beta = alpha + WindowSize;
>
>I thought this idea came from Crafty, but now I can't find it in the Crafty
>source. Further, although it makes the initial ply's slightly slower, it speeds
>up the search overall and improves the LCTII score as well.

I think I have seen it in Crafty too. As wel as in several other programs.

>Question:
>	Is there any harm in updating beta to the aspiration window size at the root
>when a score is backed up to the root and alpha is changed?
>
>	Is this idea good, bad, neither?
>
>	Did this come from Crafty at one point?

Personally I don't see how it could possibly do any harm. The way I see it: if
there can be won material it's not much faster than without aspiration window.
However is there is *no* combination ahead, it *is* faster.

Anyway: aspiration window or not should give the same score.

If it is taken out of the Crafty source I would be surpised...


Regards,
Bas Hamstra.


>
>William
>wbryant@ix.netcom.com



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.