Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: FirstBit() in assembler - the fastest LastBit()

Author: Severi Salminen

Date: 11:52:07 01/15/02

Go up one level in this thread


On January 15, 2002 at 09:00:37, David Rasmussen wrote:

>On January 15, 2002 at 08:49:16, Severi Salminen wrote:
>
>>
>>But then again, why not use the allready equally fast FirstBit()...
>>
>>Severi
>
>I have both a LastBit and a FirstBit for several reasons. First of all, if I
>know there is a white passer on a file (because I store that in my pawn hash
>table), but I don't know what square it is on, I can do
>LastBit(pos.bitboard[WHITE][PAWN] & FileMask(file)). This can't be done with
>FirstBit(). FirstBit() will be used equivalently for black passers, though.

[snipped...]

You were totally correct, but what I meant is that if there is only one 1-bit in
a BitBoard, _then_ it doesn't matter which one (of my examples...) you use. Of
course I agree with all what you said.

Severi



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.