Author: Ian Osgood
Date: 15:58:12 07/29/99
Do other program authors curtail the search when there is a forced move at the root? How do you detect that a root move may be forced? 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.) Thanks, Ian
This page took 0.03 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.