Computer Chess Club Archives




Subject: Re: Couple of chess programming questions

Author: Gian-Carlo Pascutto

Date: 15:18:35 09/10/02

Go up one level in this thread

On September 10, 2002 at 16:35:24, Sven Reichard wrote:

>This is a worst case scenario. The MDT(f) algorithm uses a fail-soft test, so
>usually if you call it with a bound  of, say, 0.01, it doesn't tell you it's
>greater than 0.01, but rather "it's at least 0.08". This saves you on average
>quite a few steps.

This is what you hope for. But in reality, most of the time you do get only
0.01 steps. (Practical experience for me)

>For me it didn't work since MDT(f) introduced tactical errors. Still trying to
>figure it out, but I suspect it's the combination of minimal windows with
>agressive null-move pruning.

PVS also searches the majority of the tree with zero windows, so the answer
is most likely just that you have bugs.


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.