/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
#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 DistanceRingsBB[64][8];
-Bitboard ForwardBB[2][64];
-Bitboard PassedPawnMask[2][64];
-Bitboard AttackSpanMask[2][64];
-Bitboard PseudoAttacks[6][64];
-
-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 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 PawnAttackSpan[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 = 0x218A392CD3D5DBFULL;
+ 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
- uint8_t BitCount8Bit[256];
typedef unsigned (Fn)(Square, Bitboard);
void init_magics(Bitboard table[], Bitboard* attacks[], Bitboard magics[],
Bitboard masks[], unsigned shifts[], Square deltas[], Fn index);
+
+ FORCE_INLINE unsigned bsf_index(Bitboard b) {
+
+ // 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;
+ }
}
/// lsb()/msb() finds the least/most significant bit in a nonzero bitboard.
#if !defined(USE_BSFQ)
-Square lsb(Bitboard b) {
-
- if (Is64Bit)
- return Square(BSFTable[((b & -b) * DeBruijn_64) >> 58]);
-
- b ^= (b - 1);
- uint32_t fold = unsigned(b) ^ unsigned(b >> 32);
- return Square(BSFTable[(fold * DeBruijn_32) >> 26]);
-}
+Square lsb(Bitboard b) { return BSFTable[bsf_index(b)]; }
Square pop_lsb(Bitboard* b) {
Bitboard bb = *b;
*b = bb & (bb - 1);
-
- if (Is64Bit)
- return Square(BSFTable[((bb & -bb) * DeBruijn_64) >> 58]);
-
- bb ^= (bb - 1);
- uint32_t fold = unsigned(bb) ^ unsigned(bb >> 32);
- return Square(BSFTable[(fold * DeBruijn_32) >> 26]);
+ return BSFTable[bsf_index(bb)];
}
Square msb(Bitboard b) {
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';
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 (File f = FILE_A; f <= FILE_H; f++)
- {
AdjacentFilesBB[f] = (f > FILE_A ? FileBB[f - 1] : 0) | (f < FILE_H ? FileBB[f + 1] : 0);
- ThisAndAdjacentFilesBB[f] = FileBB[f] | AdjacentFilesBB[f];
- }
for (Rank r = RANK_1; r < RANK_8; r++)
InFrontBB[WHITE][r] = ~(InFrontBB[BLACK][r + 1] = InFrontBB[BLACK][r] | RankBB[r]);
for (Square s = SQ_A1; s <= SQ_H8; s++)
{
ForwardBB[c][s] = InFrontBB[c][rank_of(s)] & FileBB[file_of(s)];
- PassedPawnMask[c][s] = InFrontBB[c][rank_of(s)] & ThisAndAdjacentFilesBB[file_of(s)];
- AttackSpanMask[c][s] = InFrontBB[c][rank_of(s)] & AdjacentFilesBB[file_of(s)];
+ PawnAttackSpan[c][s] = InFrontBB[c][rank_of(s)] & AdjacentFilesBB[file_of(s)];
+ PassedPawnMask[c][s] = ForwardBB[c][s] | PawnAttackSpan[c][s];
}
for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++)
if (SquareDistance[s1][s2] == d)
DistanceRingsBB[s1][d - 1] |= 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 * DeBruijn_32) >> 26] = i;
- }
- else
- BSFTable[((1ULL << i) * DeBruijn_64) >> 58] = i;
-
int steps[][9] = { {}, { 7, 9 }, { 17, 15, 10, 6, -6, -10, -15, -17 },
{}, {}, {}, { 9, 7, -7, -9, 8, 1, -1, -8 } };
// until we find the one that passes the verification test.
do {
do magics[s] = pick_random(rk, booster);
- while (BitCount8Bit[(magics[s] * masks[s]) >> 56] < 6);
+ while (popcount<Max15>((magics[s] * masks[s]) >> 56) < 6);
memset(attacks[s], 0, size * sizeof(Bitboard));