Author: Scott Gasch
Date: 23:19:30 08/12/99
Hey, I have a (stupid?) question about aspiration search. I understand the concept is to atrificially limit the search window in an effort to prune faster. However, a value returned from Search(pos, a, b) will always be within the a-b window. I.e. a <= value <= b. How, then, does one tell if the value returned is bogus and needs to be re-Searched or whether it is good? Which does a value == a or value == b mean? Thanks, Scott
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.