Author: Uri Blass
Date: 11:34:42 12/11/03
Go up one level in this thread
On December 11, 2003 at 13:16:04, Tord Romstad wrote: >On December 11, 2003 at 12:27:51, Robert Hyatt wrote: > >>On December 11, 2003 at 09:41:38, Tord Romstad wrote: >> >>>I now extend at the beginning of the search, directly after the call to the >>>static evaluation function. The advantage of doing like this is that you >>>know much more about the effect of the move, because you can look at how >>>the move played affected the various components of the evaluation function. >>> >>If you care about the evaluation, why not call it _inside_ the loop rather >>than at the top of search one level down? You save time for sure by avoiding >>the procedure call, and stuff... > >I could do that, of course, but the beginning of the search function seems >like the most natural and clear place to have the call to the evaluation >function. > >I am sure the time needed to call the procedure is too small to be noticable. > >Tord What do you mean by the search? I know that you use internal iterative deepening. Do you call search with reduced depth to do it? If yes then you calculate the evaluation of the same position twice except very small depth so it seems not to be only calling procedures. If not then I do not understand what do you mean by search. Uri
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.