Author: Robert Hyatt
Date: 09:26:54 04/14/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? I am talking about _initial_ ordering before you start the iterated search. IE in Crafty, in RootMoves() I make each move and do a q-search call on the resulting position to get a quick estimate of the score. I use this score for the test I mentioned... > > >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)
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.