Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Crafty internal iterative deepening

Author: Tijs van Dam

Date: 06:36:00 01/26/00

Go up one level in this thread


On January 26, 2000 at 09:29:27, Robert Hyatt wrote:

>On January 26, 2000 at 08:08:01, Tijs van Dam wrote:
>
>OK:  The normal window failed low.  I am now going to do a search that I
>_know_ can't fail low, because alpha=-INFINITY...
>
>
>
>>    	if (value <= alpha) {
>>		value=ABSearch(tree,-MATE,beta,wtm,depth-2*INCPLY,ply,DO_NULL);
>
>here the following line is missing:
>
>      tree->hash_move[ply]=tree->pv[ply-1].path[ply];
>
>This was deleted somewhere along the way.  However it isn't really
>important...  this case is _very_ rare....  a search to depth=N will produce
>a score of X,  A search to depth=N-something only rarely fails low and breaks
>this...
>

I see. But why did you keep the line for the research in? It is useless now,
isn't it?



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.