#include "bitboard.h"
#include "bitcount.h"
+#include "misc.h"
#include "rkiss.h"
CACHE_LINE_ALIGNMENT
-Bitboard RMasks[64];
-Bitboard RMagics[64];
-Bitboard* RAttacks[64];
-unsigned RShifts[64];
-
-Bitboard BMasks[64];
-Bitboard BMagics[64];
-Bitboard* BAttacks[64];
-unsigned BShifts[64];
-
-Bitboard SquareBB[64];
-Bitboard FileBB[8];
-Bitboard RankBB[8];
-Bitboard AdjacentFilesBB[8];
-Bitboard ThisAndAdjacentFilesBB[8];
-Bitboard InFrontBB[2][8];
-Bitboard StepAttacksBB[16][64];
-Bitboard BetweenBB[64][64];
-Bitboard ForwardBB[2][64];
-Bitboard PassedPawnMask[2][64];
-Bitboard AttackSpanMask[2][64];
-Bitboard PseudoAttacks[6][64];
-
-uint8_t BitCount8Bit[256];
-int SquareDistance[64][64];
+Bitboard RMasks[SQUARE_NB];
+Bitboard RMagics[SQUARE_NB];
+Bitboard* RAttacks[SQUARE_NB];
+unsigned RShifts[SQUARE_NB];
+
+Bitboard BMasks[SQUARE_NB];
+Bitboard BMagics[SQUARE_NB];
+Bitboard* BAttacks[SQUARE_NB];
+unsigned BShifts[SQUARE_NB];
+
+Bitboard SquareBB[SQUARE_NB];
+Bitboard FileBB[FILE_NB];
+Bitboard RankBB[RANK_NB];
+Bitboard AdjacentFilesBB[FILE_NB];
+Bitboard ThisAndAdjacentFilesBB[FILE_NB];
+Bitboard InFrontBB[COLOR_NB][RANK_NB];
+Bitboard StepAttacksBB[PIECE_NB][SQUARE_NB];
+Bitboard BetweenBB[SQUARE_NB][SQUARE_NB];
+Bitboard DistanceRingsBB[SQUARE_NB][8];
+Bitboard ForwardBB[COLOR_NB][SQUARE_NB];
+Bitboard PassedPawnMask[COLOR_NB][SQUARE_NB];
+Bitboard AttackSpanMask[COLOR_NB][SQUARE_NB];
+Bitboard PseudoAttacks[PIECE_TYPE_NB][SQUARE_NB];
+
+int SquareDistance[SQUARE_NB][SQUARE_NB];
namespace {
+ // De Bruijn sequences. See chessprogramming.wikispaces.com/BitScan
+ const uint64_t DeBruijn_64 = 0x3F79D71B4CB0A89ULL;
+ const uint32_t DeBruijn_32 = 0x783A9B23;
+
CACHE_LINE_ALIGNMENT
- int BSFTable[64];
int MS1BTable[256];
+ Square BSFTable[SQUARE_NB];
Bitboard RTable[0x19000]; // Storage space for rook attacks
Bitboard BTable[0x1480]; // Storage space for bishop attacks
void init_magics(Bitboard table[], Bitboard* attacks[], Bitboard magics[],
Bitboard masks[], unsigned shifts[], Square deltas[], Fn index);
-}
-
-/// first_1() finds the least significant nonzero bit in a nonzero bitboard.
-/// pop_1st_bit() finds and clears the least significant nonzero bit in a
-/// nonzero bitboard.
-#if defined(IS_64BIT) && !defined(USE_BSFQ)
+ FORCE_INLINE unsigned bsf_index(Bitboard b) {
-Square first_1(Bitboard b) {
- return Square(BSFTable[((b & -b) * 0x218A392CD3D5DBFULL) >> 58]);
+ // Matt Taylor's folding for 32 bit systems, extended to 64 bits by Kim Walisch
+ b ^= (b - 1);
+ return Is64Bit ? (b * DeBruijn_64) >> 58
+ : ((unsigned(b) ^ unsigned(b >> 32)) * DeBruijn_32) >> 26;
+ }
}
-Square pop_1st_bit(Bitboard* b) {
- Bitboard bb = *b;
- *b &= (*b - 1);
- return Square(BSFTable[((bb & -bb) * 0x218A392CD3D5DBFULL) >> 58]);
-}
+/// lsb()/msb() finds the least/most significant bit in a nonzero bitboard.
+/// pop_lsb() finds and clears the least significant bit in a nonzero bitboard.
-#elif !defined(USE_BSFQ)
+#if !defined(USE_BSFQ)
-Square first_1(Bitboard b) {
- b ^= (b - 1);
- uint32_t fold = unsigned(b) ^ unsigned(b >> 32);
- return Square(BSFTable[(fold * 0x783A9B23) >> 26]);
-}
+Square lsb(Bitboard b) { return BSFTable[bsf_index(b)]; }
-Square pop_1st_bit(Bitboard* b) {
+Square pop_lsb(Bitboard* b) {
Bitboard bb = *b;
*b = bb & (bb - 1);
- bb ^= (bb - 1);
- uint32_t fold = unsigned(bb) ^ unsigned(bb >> 32);
- return Square(BSFTable[(fold * 0x783A9B23) >> 26]);
+ return BSFTable[bsf_index(bb)];
}
-Square last_1(Bitboard b) {
+Square msb(Bitboard b) {
unsigned b32;
int result = 0;
result += 8;
}
- return Square(result + MS1BTable[b32]);
+ return (Square)(result + MS1BTable[b32]);
}
#endif // !defined(USE_BSFQ)
void Bitboards::print(Bitboard b) {
+ sync_cout;
+
for (Rank rank = RANK_8; rank >= RANK_1; rank--)
{
std::cout << "+---+---+---+---+---+---+---+---+" << '\n';
for (File file = FILE_A; file <= FILE_H; file++)
- std::cout << "| " << ((b & make_square(file, rank)) ? "X " : " ");
+ std::cout << "| " << (b & (file | rank) ? "X " : " ");
std::cout << "|\n";
}
- std::cout << "+---+---+---+---+---+---+---+---+" << std::endl;
+ std::cout << "+---+---+---+---+---+---+---+---+" << sync_endl;
}
while (k < (2 << i))
MS1BTable[k++] = i;
- for (Bitboard b = 0; b < 256; b++)
- BitCount8Bit[b] = (uint8_t)popcount<Max15>(b);
+ for (int i = 0; i < 64; i++)
+ BSFTable[bsf_index(1ULL << i)] = Square(i);
for (Square s = SQ_A1; s <= SQ_H8; s++)
SquareBB[s] = 1ULL << s;
for (Square s2 = SQ_A1; s2 <= SQ_H8; s2++)
SquareDistance[s1][s2] = std::max(file_distance(s1, s2), rank_distance(s1, s2));
- for (int i = 0; i < 64; i++)
- if (!Is64Bit) // Matt Taylor's folding trick for 32 bit systems
- {
- Bitboard b = 1ULL << i;
- b ^= b - 1;
- b ^= b >> 32;
- BSFTable[(uint32_t)(b * 0x783A9B23) >> 26] = i;
- }
- else
- BSFTable[((1ULL << i) * 0x218A392CD3D5DBFULL) >> 58] = i;
+ for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++)
+ for (int d = 1; d < 8; d++)
+ for (Square s2 = SQ_A1; s2 <= SQ_H8; s2++)
+ if (SquareDistance[s1][s2] == d)
+ DistanceRingsBB[s1][d - 1] |= s2;
int steps[][9] = { {}, { 7, 9 }, { 17, 15, 10, 6, -6, -10, -15, -17 },
{}, {}, {}, { 9, 7, -7, -9, 8, 1, -1, -8 } };
}
- Bitboard pick_random(Bitboard mask, RKISS& rk, int booster) {
-
- Bitboard magic;
+ Bitboard pick_random(RKISS& rk, int booster) {
// Values s1 and s2 are used to rotate the candidate magic of a
// quantity known to be the optimal to quickly find the magics.
int s1 = booster & 63, s2 = (booster >> 6) & 63;
- while (true)
- {
- magic = rk.rand<Bitboard>();
- magic = (magic >> s1) | (magic << (64 - s1));
- magic &= rk.rand<Bitboard>();
- magic = (magic >> s2) | (magic << (64 - s2));
- magic &= rk.rand<Bitboard>();
-
- if (BitCount8Bit[(mask * magic) >> 56] >= 6)
- return magic;
- }
+ Bitboard m = rk.rand<Bitboard>();
+ m = (m >> s1) | (m << (64 - s1));
+ m &= rk.rand<Bitboard>();
+ m = (m >> s2) | (m << (64 - s2));
+ return m & rk.rand<Bitboard>();
}
// Find a magic for square 's' picking up an (almost) random number
// until we find the one that passes the verification test.
do {
- magics[s] = pick_random(masks[s], rk, booster);
+ do magics[s] = pick_random(rk, booster);
+ while (popcount<Max15>((magics[s] * masks[s]) >> 56) < 6);
+
memset(attacks[s], 0, size * sizeof(Bitboard));
// A good magic must map every possible occupancy to an index that
if (attack && attack != reference[i])
break;
+ assert(reference[i] != 0);
+
attack = reference[i];
}
} while (i != size);
projects / stockfish / blobdiff