Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Bitboard representation

Author: Sune Fischer

Date: 10:26:15 10/04/02

Go up one level in this thread


On October 04, 2002 at 11:24:40, Vincent Diepeveen wrote:

>On October 03, 2002 at 14:50:23, Bo Persson wrote:
>
>>On October 01, 2002 at 08:19:31, Vincent Diepeveen wrote:
>>
>>> you need loads of inline assembly for nearly any architecture
>>>to keep going and you need a 64 bits processor to not be 2 times slower
>>>than a non-bitboarder.
>>>
>>
>>Do you want to see how much asm I need for a bitboard program?
>
>i'm talking about chess at 32 bits processors, not about
>some checker program which has 32 squares :)
>
>anyway how many moves a second can you generate after
>1.e4,e5 2.d4,d5 :)

A more interesting question would perhaps be how many captures
he could generate...

-S.

>>Here it is, in its entirety:
>>
>>   // Assembly helpers
>>
>>// warning C4035: 'BSR' : no return value
>>#pragma warning(disable : 4035)
>>
>>   inline unsigned BSR(unsigned Bits)
>>   { __asm bsr eax,[Bits] }
>>
>>   inline unsigned BSF(unsigned Bits)
>>   { __asm bsf eax,[Bits] }
>>
>>#pragma warning(default : 4035)
>>
>>
>>
>>That's it!
>>
>>
>>Bo Persson
>>bop2@telia.com



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.