Computer Chess Club Archives

Search

Messages

Subject: Re: Benchmarking chess algorithms

Author: Dann Corbit

Date: 14:30:54 07/20/99

Go up one level in this thread

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.

• Nominating chess algorithms Vincent Diepeveen 16:51:57 07/20/99
  • Re: Nominating chess algorithms Robert Hyatt 12:00:43 07/21/99
    • Re: Nominating chess algorithms Vincent Diepeveen 04:43:28 07/22/99
      • Re: Nominating chess algorithms blass uri 07:25:18 07/22/99
        • Re: Nominating chess algorithms Inmann Werner 14:18:20 07/22/99
  • Re: Nominating chess algorithms blass uri 10:13:06 07/21/99
  • Re: Nominating chess algorithms Dann Corbit 16:57:14 07/20/99
    • Re: Nominating chess algorithms Vincent Diepeveen 17:27:29 07/20/99
    • Re: Nominating chess algorithms Andrew Williams 17:19:17 07/20/99

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.