Author: Robert Hyatt
Date: 06:46:32 12/12/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 It depends on your definition of "call the procedure". IE you have to propogate stuff from ply N to N+1. I do a repetition check and hash probe and null-move search at the top of the next iteration. That's a lot of work to discover that a move should somehow be treated differently or not at all... However, that is a design decision, and both are equivalent if written with the same idea.
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.