Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Question to Bob: Crafty , Alpha and FindBit()

Author: Robert Hyatt

Date: 04:37:44 06/08/98

Go up one level in this thread


On June 08, 1998 at 07:17:08, Vincent Diepeveen wrote:

>
>On June 05, 1998 at 21:48:57, Robert Hyatt wrote:
>
>>On June 05, 1998 at 17:47:07, Bruce Moreland wrote:
>>
>>>
>>>On June 05, 1998 at 08:53:53, Ernst A. Heinz wrote:
>>>
>>>>BTW, we have been waiting to get our hands on a Alpha-21264 for roughly
>>>>a year because "DarkThought" will hopefully speed up as much on them
>>>>as "Crafty".
>>>
>>>What percentage of execution time do you and Bob spend doing these
>>>operations, do you think?
>>>
>>>bruce
>>
>>FindFirstOne() = 1-2% in crafty.  popcnt is much less...  so that won't
>>help a whole lot.  but the 64 bit stuff helps in general...
>
>Well that doesn't say anything concrete.
>
>More important is the overall delay.
>
>At a P133 intel the speed difference between crafty's move generator
>and diep's move generator is somewhat more than 3 times.
>
>Crafty is more than 3 times slower, because of bitboards, which perform
>badly at 32 bits. Note that the more possibilities, this 3 times will
>become
>4 times.
>
>For something taking 1 clockcycle in my program and which can
>be even pipelined in U + V pipe,
>crafty needs sometimes even a whole function.
>
>Greetings,
>Vincent


yes... but try to generate nothing but captures and compare that, which
is a major part of the total tree search...



This page took 0.01 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.