Author: David Blackman
Date: 18:42:52 03/17/98
Go up one level in this thread
Actually about positions like KNkp and how thay should be evaluated. It looks like Junior, Crafty and maybe others are evaluating such positions as not winnable as soon as they appear in the tree. Surely it would be better to allow the tree to grow out to its normal depth, and just detect these (probably drawn) positions in the normal end-node evaluator. That way your program "knows" it is a draw, unless the win is shallow enough to see in the search, in which case it finds it. Of course that makes the search tree a bit bigger for a given depth. Has anyone tried both approaches to see how big the cost is?
This page took 0.01 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.