Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Nominating chess algorithms

Author: blass uri

Date: 10:13:06 07/21/99

Go up one level in this thread



On July 20, 1999 at 19:51:57, Vincent Diepeveen wrote:

>On July 20, 1999 at 17:30:54, Dann Corbit wrote:
>
>>On July 20, 1999 at 17:26:49, Dave Gomboc wrote:
>>[snip]
>>>None of the commercials I know of provide source code, so this might be tough to
>>>arrange.  Is your opinion that Crafty would be adequate?
>>I see possible solutions:
>>0.  We are provided with an object module and permission to use it for the test
>>only.
>>1.  We keep a record of the fastest currently tested implementation.
>>2.  We hold a contest with prizes for the winning algorithm.
>
>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.

I disagree about it.
Junior is one of the best programs and it does not use the null move.

Uri



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.