Author: Fabien Letouzey
Date: 08:33:38 04/20/04
Go up one level in this thread
On April 20, 2004 at 11:27:08, Volker Böhm wrote:
>(our example below) If you search with window [+8,+9] and get +10 as result then
>you can store +10 to hash ("fail-soft-soloution") or +9 (== beta)
>("fail-hard-soloution"). In my test suite this "fail-hard-soloution" was good
>enough to get allmost everytime a good pv. But additional nodes! It is too
>significant to live with.
We agree that fail hard does not solve the problem all the time then.
About additional nodes; do you have figures?
Fabien.
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.