Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Couple of chess programming questions

Author: Dann Corbit

Date: 17:45:09 09/10/02

Go up one level in this thread


On September 10, 2002 at 20:17:21, Gian-Carlo Pascutto wrote:

>On September 10, 2002 at 19:52:32, Dann Corbit wrote:
>
>>If MTD(f) were linear [or linear behavior happened more than once in a blue
>>moon], then PostModernist would not score nearly so well, I think.
>
>I'm fairly sure Andrew uses convergence accelerators, so it's not
>strictly MTD(n,f) in PostModernist.

I thought of trying 3 points in a small window near the guess and fitting a
parabola through them.  Perhaps we could make a guess based on the number of
nodes to fail high or fail low.

What kind of convergence accelerators are you meaning?  I don't think I have
read anything about that (or if I have, I don't remember it).



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.