Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Benchmarking chess algorithms

Author: Vincent Diepeveen

Date: 23:15:36 07/20/99

Go up one level in this thread


On July 20, 1999 at 20:48:49, vitor wrote:

>On July 20, 1999 at 17:12:12, Vincent Diepeveen wrote:
>
>>On July 20, 1999 at 12:12:14, Dann Corbit wrote:
>>
>>>I think it would be interesting to benchmark chess algorithms:
>>>0. Move generators -- all types
>>
>>Cool idea. after 1.e4,e5 2.d4,d5 my program can generate
>>15.5M nodes a second at a PII450. Used compiler: msvc 6.0
>>My move format consists out of 2 integers.
>>
>
>yikes that is fast. does that figure include doing basic material eval and
>legality check?

read what i write: "generation speed"
it's just a loop to generate a big bunch of million times the same
(semi)legal moves after 1.e4,e5 2.d4,d5



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.