Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Building the Principal Variation in MTD(f) searches

Author: Vincent Diepeveen

Date: 14:42:39 07/19/99

Go up one level in this thread


On July 19, 1999 at 13:24:26, KarinsDad wrote:

>On July 18, 1999 at 14:22:14, Vincent Diepeveen wrote:
>
>[snip]
>>
>>I don't intend to get down the research of Aske. It's really very good
>>of him that he has invented a way of searching using only 1 bound instead
>>of 2, where near to no one these days invents new search ideas.
>>
>
>Well, I guess I am near to no one since my search schema is like nothing I have
>read about on the Internet or in this forum. Course, it is not complete, so it's
>hard to tell if it is any better, but one can hope.
>
>KarinsDad :)

Feel free to post ideas. No one is gonna steal it in order to write
as first an article about it in iccaj

But first tell some things about the adjustment made,
how many NOLOTS does it solve for you, when compared to the old
search?

Greetings,
Vincent



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.