Author: Tord Romstad
Date: 06:41:38 12/11/03
Go up one level in this thread
On December 11, 2003 at 08:29:08, Robert Hyatt wrote: >On December 11, 2003 at 06:44:06, Uri Blass wrote: > >>1)When do you calculate extensions > >Inside the loop where I choose and make a move and then recursively >call search. That is where I notice that the move is the only legal >move, or the move checks the opponent, or pushes a passed pawn, etc. I used to do like this, too, but changed it because it was not flexible enough. At that stage in the search, you simply don't know enough about the move to make an intelligent decision about how much to extend it. You can identify simple stuff like checks, check evasions, passed pawn pushes and so on, but nothing more sophisticated. 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. Tord
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.