Author: Gian-Carlo Pascutto
Date: 07:34:29 01/29/00
Go up one level in this thread
On January 29, 2000 at 00:11:31, David Blackman wrote: >I think this code fragment must be part of a "fail-soft" algorithm. It doesn't have to. It will run more efficient if it does though. >The idea of >fail soft is that you make sure anything that fails low returns an upper bound >on the value, and you make sure anything that fails high returns a lower bound >on the value, and you make sure the bounds you return are the best ones you can >possible get without searching more nodes. > >The main thing is to initialise the value at the top of the routine to ->infinity instead of the lower bound. And return the lower bound, not alpha, if you fail low. -- GCP
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.