Computer Chess Club Archives




Subject: Re: Hashing double bounds

Author: rasjid chan

Date: 14:19:51 06/20/05

Go up one level in this thread

On June 20, 2005 at 16:58:19, Dieter Buerssner wrote:

>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.

So I think my statistic should be correct, ie "worthless".

I delayed doing double bounds as I expected it may be complicated
and it is fairly so.


This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.