Author: Dieter Buerssner
Date: 13:58:19 06/20/05
Go up one level in this thread
On June 20, 2005 at 16:55:26, Robert Hyatt wrote: >This is more common for mtd(f) programs, since the same position may fail high >one search, and low the next, as the window passes over the true score. For >non-mtd(f) programs, two bounds is worthless. We could read here, that Fabien is using 2 bounds for a non MTD(f) engine. I myself tried it, and I failed to make progress by it. Actually, the contrary happened :-( For a while, I tried hard to find out, why this happened - then I just gave up. Dieter
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.