Computer Chess Club Archives




Subject: Re: Couple of chess programming questions

Author: Gian-Carlo Pascutto

Date: 11:19:24 09/10/02

Go up one level in this thread

On September 10, 2002 at 13:11:02, Dann Corbit wrote:

>The MTD(f) algorithm basically does a binary search between two bounds (on
>average -- it might be faster or slower in individual cases).

MTD(n,f) _as descibred by Plaat_ does not do a binary search.

It will take a first guess, and then always fail in the same
direction till it converges.

You're thinking of NegaC*, which keeps bisecting the intervals.


This page took 0.03 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.