Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Nominating chess algorithms

Author: Andrew Williams

Date: 17:19:17 07/20/99

Go up one level in this thread


On July 20, 1999 at 19:57:14, Dann Corbit wrote:

>On July 20, 1999 at 19:51:57, Vincent Diepeveen wrote:
>[snip]
>>I nominate the nullmove,
>>althoug of course alfabeta logically should qualify first,
>>alfabetapruning isn't very hard to invent. Nullmove is though.
>>
>>First prize for that nomination would be:
>> "best algorithmic improvement of the century"
>>
>>Nullmove has been nominated as #1 by me.
>>Alfabeta as second.
>>YBW as third.
>What is YBW?

"Young Brothers Wait", for multiprocessing. I think it means have one
processor search the first move from a given node - if that doesn't get
a cutoff, share out the rest.

>
>>endgametablebases as 4th.

Andrew



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.