X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbitboard.cpp;h=1bae6843df5303d3d7379e335debd7c02946b898;hp=64cba6b5fc301322299a0eb3cf0d8c5102b07867;hb=caef31921900e092616c56193e37201b08baa875;hpb=46a50cbf38bdfa5e48358585f4c98668507700ae diff --git a/src/bitboard.cpp b/src/bitboard.cpp index 64cba6b5..1bae6843 100644 --- a/src/bitboard.cpp +++ b/src/bitboard.cpp @@ -45,7 +45,7 @@ Bitboard ThisAndAdjacentFilesBB[8]; Bitboard InFrontBB[2][8]; Bitboard StepAttacksBB[16][64]; Bitboard BetweenBB[64][64]; -Bitboard SquaresInFrontMask[2][64]; +Bitboard ForwardBB[2][64]; Bitboard PassedPawnMask[2][64]; Bitboard AttackSpanMask[2][64]; Bitboard PseudoAttacks[6][64]; @@ -58,6 +58,7 @@ namespace { CACHE_LINE_ALIGNMENT int BSFTable[64]; + int MS1BTable[256]; Bitboard RTable[0x19000]; // Storage space for rook attacks Bitboard BTable[0x1480]; // Storage space for bishop attacks @@ -67,24 +68,6 @@ namespace { Bitboard masks[], unsigned shifts[], Square deltas[], Fn index); } - -/// print_bitboard() prints a bitboard in an easily readable format to the -/// standard output. This is sometimes useful for debugging. - -void print_bitboard(Bitboard b) { - - for (Rank r = RANK_8; r >= RANK_1; r--) - { - std::cout << "+---+---+---+---+---+---+---+---+" << '\n'; - for (File f = FILE_A; f <= FILE_H; f++) - std::cout << "| " << ((b & make_square(f, r)) ? "X " : " "); - - std::cout << "|\n"; - } - std::cout << "+---+---+---+---+---+---+---+---+" << std::endl; -} - - /// 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. @@ -109,37 +92,18 @@ Square first_1(Bitboard b) { return Square(BSFTable[(fold * 0x783A9B23) >> 26]); } -// Use type-punning -union b_union { - - Bitboard dummy; - struct { -#if defined (BIGENDIAN) - uint32_t h; - uint32_t l; -#else - uint32_t l; - uint32_t h; -#endif - } b; -}; - Square pop_1st_bit(Bitboard* b) { - const b_union u = *((b_union*)b); - - if (u.b.l) - { - ((b_union*)b)->b.l = u.b.l & (u.b.l - 1); - return Square(BSFTable[((u.b.l ^ (u.b.l - 1)) * 0x783A9B23) >> 26]); - } - - ((b_union*)b)->b.h = u.b.h & (u.b.h - 1); - return Square(BSFTable[((~(u.b.h ^ (u.b.h - 1))) * 0x783A9B23) >> 26]); + Bitboard bb = *b; + *b = bb & (bb - 1); + bb ^= (bb - 1); + uint32_t fold = unsigned(bb) ^ unsigned(bb >> 32); + return Square(BSFTable[(fold * 0x783A9B23) >> 26]); } Square last_1(Bitboard b) { + unsigned b32; int result = 0; if (b > 0xFFFFFFFF) @@ -148,27 +112,52 @@ Square last_1(Bitboard b) { result = 32; } - if (b > 0xFFFF) + b32 = unsigned(b); + + if (b32 > 0xFFFF) { - b >>= 16; + b32 >>= 16; result += 16; } - if (b > 0xFF) + if (b32 > 0xFF) { - b >>= 8; + b32 >>= 8; result += 8; } - return Square(result + BitCount8Bit[b]); + return Square(result + MS1BTable[b32]); } #endif // !defined(USE_BSFQ) -/// bitboards_init() initializes various bitboard arrays. It is called during + +/// Bitboards::print() prints a bitboard in an easily readable format to the +/// standard output. This is sometimes useful for debugging. + +void Bitboards::print(Bitboard b) { + + 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 << "|\n"; + } + std::cout << "+---+---+---+---+---+---+---+---+" << std::endl; +} + + +/// Bitboards::init() initializes various bitboard arrays. It is called during /// program initialization. -void bitboards_init() { +void Bitboards::init() { + + for (int k = 0, i = 0; i < 8; i++) + while (k < (2 << i)) + MS1BTable[k++] = i; for (Bitboard b = 0; b < 256; b++) BitCount8Bit[b] = (uint8_t)popcount(b); @@ -179,30 +168,27 @@ void bitboards_init() { FileBB[FILE_A] = FileABB; RankBB[RANK_1] = Rank1BB; - for (int f = FILE_B; f <= FILE_H; f++) + for (int i = 1; i < 8; i++) { - FileBB[f] = FileBB[f - 1] << 1; - RankBB[f] = RankBB[f - 1] << 8; + FileBB[i] = FileBB[i - 1] << 1; + RankBB[i] = RankBB[i - 1] << 8; } - for (int f = FILE_A; f <= FILE_H; f++) + 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 (int rw = RANK_7, rb = RANK_2; rw >= RANK_1; rw--, rb++) - { - InFrontBB[WHITE][rw] = InFrontBB[WHITE][rw + 1] | RankBB[rw + 1]; - InFrontBB[BLACK][rb] = InFrontBB[BLACK][rb - 1] | RankBB[rb - 1]; - } + for (Rank r = RANK_1; r < RANK_8; r++) + InFrontBB[WHITE][r] = ~(InFrontBB[BLACK][r + 1] = InFrontBB[BLACK][r] | RankBB[r]); for (Color c = WHITE; c <= BLACK; c++) for (Square s = SQ_A1; s <= SQ_H8; s++) { - SquaresInFrontMask[c][s] = in_front_bb(c, s) & file_bb(s); - PassedPawnMask[c][s] = in_front_bb(c, s) & this_and_adjacent_files_bb(file_of(s)); - AttackSpanMask[c][s] = in_front_bb(c, s) & adjacent_files_bb(file_of(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)]; } for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++) @@ -230,7 +216,7 @@ void bitboards_init() { { Square to = s + Square(c == WHITE ? steps[pt][k] : -steps[pt][k]); - if (square_is_ok(to) && square_distance(s, to) < 3) + if (is_ok(to) && square_distance(s, to) < 3) StepAttacksBB[make_piece(c, pt)][s] |= to; } @@ -242,9 +228,8 @@ void bitboards_init() { for (Square s = SQ_A1; s <= SQ_H8; s++) { - PseudoAttacks[BISHOP][s] = attacks_bb(s, 0); - PseudoAttacks[ROOK][s] = attacks_bb(s, 0); - PseudoAttacks[QUEEN][s] = PseudoAttacks[BISHOP][s] | PseudoAttacks[ROOK][s]; + PseudoAttacks[QUEEN][s] = PseudoAttacks[BISHOP][s] = attacks_bb(s, 0); + PseudoAttacks[QUEEN][s] |= PseudoAttacks[ ROOK][s] = attacks_bb< ROOK>(s, 0); } for (Square s1 = SQ_A1; s1 <= SQ_H8; s1++) @@ -267,7 +252,7 @@ namespace { for (int i = 0; i < 4; i++) for (Square s = sq + deltas[i]; - square_is_ok(s) && square_distance(s, s - deltas[i]) == 1; + is_ok(s) && square_distance(s, s - deltas[i]) == 1; s += deltas[i]) { attack |= s;