Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Rough comparison between rotated bitboards and 0x88 -tests for check

Author: Andrew Dados

Date: 16:05:36 06/20/00

Go up one level in this thread


On June 20, 2000 at 07:29:12, Mike Curtis wrote:

>On June 20, 2000 at 04:51:39, Tony Werten wrote:
>
>>On June 20, 2000 at 04:48:05, James Robertson wrote:
>>
>>>On June 20, 2000 at 04:44:57, Tony Werten wrote:
>>>
>>>>On June 20, 2000 at 03:50:36, James Robertson wrote:
>>>>
>>>>>On June 20, 2000 at 03:09:49, Tony Werten wrote:
>>>>>
>>>>>>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.
>>>>>
>>>>>I do not understand.... could you please elaborate?
>>>>
>>>>Sure,
>>>>
>>>>If you exclude a rochade, a check can only occur in 2 ways.

And what about En Passant? (I use similar code, so... :)
>[D]8/5p1k/8/6P1/8/3B3K/8/8 b - -

now black moves f7-f5, white goes gxf+...
-cheers-
Andrew

[snip]



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.