Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question regarding: Aspiraton Window Search (a correction)

Author: Dann Corbit

Date: 16:56:11 05/31/02

Go up one level in this thread


On May 31, 2002 at 19:54:20, Gian-Carlo Pascutto wrote:

>On May 31, 2002 at 19:48:47, Dann Corbit wrote:
>
>>On May 31, 2002 at 18:50:18, Omid David wrote:
>>
>>>I forgot to change "negascout" to "AlphaBeta" in 7th line for better
>>>illustration. Here is the correction:
>>>
>>>int AspWin(int estimate, int delta, int depth)
>>>{
>>>int alpha = estimate - delta;
>>>int beta = estimate + delta;
>>>int best;
>>>
>>>best = AlphaBeta(alpha, beta, depth);
>>>
>>>/* re-search */
>>>if(best <= alpha)
>>>best = AlphaBeta(-10000, beta, depth);
>>>else if(best >= beta)
>>>best = AlphaBeta(alpha, 10000, depth);
>>>
>>>/* is there any better way to handle this very rare case? */
>>>if(best >= beta || best <= alpha)
>>>best = AlphaBeta(-10000, 10000, depth);
>>>
>>>return best;
>>>}
>>
>>Faile:
>
>
>Doesn't use aspiration search...

Half-way through my little round up I forgot what I was looking for and just
grabbed the iterative deepening section of the programs.

Some of the others I posted are surely also not applicable.



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.