Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Couple of chess programming questions

Author: Dann Corbit

Date: 15:39:40 09/10/02

Go up one level in this thread


On September 10, 2002 at 18:25:25, Dann Corbit wrote:

>On September 10, 2002 at 18:13:51, Gian-Carlo Pascutto wrote:
>
>>On September 10, 2002 at 18:12:01, Dann Corbit wrote:
>>
>>
>>>Suppose that we perform a binary search
>>
>>I'm talking about MTD(n,f). It does *not* do that.
>
>No it does not.  But it is similar.  And about the same speed (within a small
>constant factor).

Here is what I originally said:
"The MTD(f) algorithm basically does a binary search between two bounds (on
average -- it might be faster or slower in individual cases)."

Now, that is not an accurate description - I must admit.

What I should have said is that MTD(f) does a heuristic search based on
estimates which gradually narrows the interval of possible solution.  It is
approximately of the same efficiency as a binary search, but there is no
relationship between them.

Better?
;-)



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.