Author: Christophe Theron
Date: 23:21:41 04/13/04
Go up one level in this thread
On April 14, 2004 at 00:26:34, Eric Oldre wrote:
>After you find the 1st "good" move don't you narrow the alpha beta window so
>that you don't know how much worse the 2nd move is, only that it is not as good
>as alpha?
>
>Or do you not narrow the window at the root node? that seems like it would
>greatly expand your search tree.
>
>or am i missing something else?
>
>
>On April 14, 2004 at 00:09:24, Robert Hyatt wrote:
>
>>Simple idea:
>>
>>a move is "easy" and can be made after using less than the planned time limit if
>>and only if
>>
>>1. estimated score for first root move is way higher than the second move. IE
>>say 2.00 better.
>>
>>2. This is a recapture. IE opponent just captured a piece of ours and we are
>>recapturing on the same square.
>>
>>Other types of "easy" moves have higher risk to stop the search early...
>>
>>
>>>
>>>Thanks,
>>>Eric Oldre (new chess programmer)
I think that by "estimated score", Bob means the score returned by a SEE (Static
Exchange Evaluator), not by a real search.
Christophe
This page took 0.01 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.