Computer Chess Club Archives




Subject: Re: perft records

Author: Peter Fendrich

Date: 08:04:59 09/06/04

Go up one level in this thread

On September 06, 2004 at 09:34:40, Uri Blass wrote:

>On September 06, 2004 at 09:21:36, Peter Fendrich wrote:
>>On September 06, 2004 at 09:06:06, Reinhard Scharnagl wrote:
>>>On September 06, 2004 at 07:43:51, Peter Fendrich wrote:
>>>>What free programs have the fastest perft and what are the figures?
>>>>Please, If you give figures also add processor, compiler and environment!
>>>>I want to compare with a new concept that isn't coded yet...
>>>Hi Peter,
>>>see some of my (Smirf) results (still improved after measuring) at:
>>>a) without TT: []
>>>b) with    TT: []
>>>Regards, Reinhard.
>>Hi Reinhard,
>>I'm not sure how to read this. A few questions:
>>It says break time 75 sec but in the table I find 166 sec. Is it 166 that
>>I should count as the ply 7 result?
>It seems that the program calculate perft 1 perft 2,... and stop when it finds
>perft that takes more than 75 seconds.
>>That will get 3195901860/166 = 19252421 n/sec  Correct?
>>Pretty fast!
>Yes smirf is very fast
>Probably faster than movei(I do not use hash for perft and
>was not interested in making it faster after it was fast enough).
>I will check later the speed of perft with the latest version with fast

Please do!

>I do not use makemove for the last ply because there is no need to do it with
>legal move generator.
>My makemove also does expensive things like updating the attack tables to
>prepare generating next move and calculating evaluation except mobility so it
>will be very expensive to use makemove in the last ply.

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.