Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: Rough comparison between rotated bitboards and 0x88

Author: Tony Werten

Date: 00:09:49 06/20/00

Go up one level in this thread

On June 19, 2000 at 19:54:39, James Robertson wrote:

>On June 19, 2000 at 19:48:36, Larry Griffiths wrote:
>
>>I have found bitboards to be an even trade-off on my Pentium system.  I have to
>>update about 6 bitboards when a piece moves and this generates a lot of
>>instructions.  I get it back in my IsKingInCheck code so it evens out.
>
>While detecting check is faster with bitboards if you have many pieces on the
>board, I think it is actually slower in endgame positions. :(

I don't understand this. I have written it before but here it is again. You only
have to look at the to and from square of the last move.

It has nothing to do with the number of pieces.

Tony

>
>James
>
>> I like
>>to have fast move generation code, but most of my gains have been through
>>alpha-beta, hash-table, killer-move and movelist ordering etc.
>>
>>Larry.

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.