Computer Chess Club Archives




Subject: Re: Couple of chess programming questions

Author: Dann Corbit

Date: 15:12:01 09/10/02

Go up one level in this thread

On September 10, 2002 at 18:03:02, Gian-Carlo Pascutto wrote:

>On September 10, 2002 at 17:08:23, Dann Corbit wrote:
>>Since it searches until upperbound and lowerbound converge, evidently, they can
>>exchange roles.
>They do not within an MTD search. The search process goes like this:
>guess: 50
>first search: fail low at 50, new guess 49
>second search: fail low at 49, new guess 45
>twentieth search: fail low at -20, new guess -19
>twentyfirst search: fail high at -19
>At this point, we have converged at -19.
>It always goes in a single direction. This isn't a binary search
>by any definition.

Suppose that we perform a binary search where our initial guess is not the
midpoint, but instead is very near to the true answer.  What will the sequence
look like?

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