Author: Steffen Jakob
Date: 02:57:54 08/11/03
Go up one level in this thread
On August 10, 2003 at 23:44:57, Rick Bischoff wrote: >Is this a "good" way to test an evaluation function-- > >Algorithm A >1) If Black is on the move, make the null move >1.b) If depth <= 0 return static evaluation >2) If white is on the move, eliminate checks and captures from the move list. >3) Make each move, call algorithm A recursively, unmake move >4) return best move, best score I already use this for a while. I find it helpful if your static eval only evaluates some certain patterns on which you are working. You get a good feeling if you examine how your engine converges against a certain position. Greetings, Steffen.
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.