Author: Dann Corbit
Date: 17:47:14 07/29/99
Go up one level in this thread
On July 29, 1999 at 18:58:12, Ian Osgood wrote: >Do other program authors curtail the search when there is a forced move at the >root? Crafty does. It causes havoc with the Chess Analysis Project. Fortunately, Hiarcs will actually process such a position if I ask it to. >How do you detect that a root move may be forced? Umm.. You have no other choices but one? >Could you compare the values of the best and second-best root moves after a >search iteration to detect a forced root move? (Granted, the second-best score >won't be accurate due to alpha-beta, but I figure that if the difference was >greater than a queen's value, you could still conclude that the best move was >forced.) Here is how I would detect it: 0. Am I in check? 1. Is there only one way to get out of check? If so, then the move is forced. Otherwise, the move is not forced.
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.