Author: rasjid chan
Date: 08:10:16 03/23/04
Go up one level in this thread
On March 23, 2004 at 09:43:31, Jaime Benito de Valle Ruiz wrote: >If you're using a small aspiration window at the root, and it fails low (this is >a score below the lower window value, right?), is there any chance that the REAL >score is actually above the window value? If this is possible, could you give me >an example? >Thank you, > > Jaime I think this is about search inconsistency or instability. If you don't have hashing, prunning, extentions that are dependent on alpha-beat bounds, all subsequent research searches the same tree basically and a research score cannot be higher than your first upper bound. Rasjid
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.