X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fbitboard.h;h=945791249a212b6d3f327b5447c460d223981966;hp=59de12886e513f55b6ba2ffae18cfe4ce96986bd;hb=dfd030b67af4e651a73232ab15182fe669909ef1;hpb=c2c185423b13b0227c86009c6006e48e8d258896 diff --git a/src/bitboard.h b/src/bitboard.h index 59de1288..94579124 100644 --- a/src/bitboard.h +++ b/src/bitboard.h @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2008-2012 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 @@ -23,30 +23,9 @@ #include "types.h" -const Bitboard EmptyBoardBB = 0; - -const Bitboard FileABB = 0x0101010101010101ULL; -const Bitboard FileBBB = FileABB << 1; -const Bitboard FileCBB = FileABB << 2; -const Bitboard FileDBB = FileABB << 3; -const Bitboard FileEBB = FileABB << 4; -const Bitboard FileFBB = FileABB << 5; -const Bitboard FileGBB = FileABB << 6; -const Bitboard FileHBB = FileABB << 7; - -const Bitboard Rank1BB = 0xFF; -const Bitboard Rank2BB = Rank1BB << (8 * 1); -const Bitboard Rank3BB = Rank1BB << (8 * 2); -const Bitboard Rank4BB = Rank1BB << (8 * 3); -const Bitboard Rank5BB = Rank1BB << (8 * 4); -const Bitboard Rank6BB = Rank1BB << (8 * 5); -const Bitboard Rank7BB = Rank1BB << (8 * 6); -const Bitboard Rank8BB = Rank1BB << (8 * 7); - -extern Bitboard SquaresByColorBB[2]; extern Bitboard FileBB[8]; -extern Bitboard NeighboringFilesBB[8]; -extern Bitboard ThisAndNeighboringFilesBB[8]; +extern Bitboard AdjacentFilesBB[8]; +extern Bitboard ThisAndAdjacentFilesBB[8]; extern Bitboard RankBB[8]; extern Bitboard InFrontBB[2][8]; @@ -60,19 +39,17 @@ extern Bitboard SquaresInFrontMask[2][64]; extern Bitboard PassedPawnMask[2][64]; extern Bitboard AttackSpanMask[2][64]; -extern uint64_t RMult[64]; -extern int RShift[64]; -extern Bitboard RMask[64]; +extern uint64_t RMagics[64]; +extern int RShifts[64]; +extern Bitboard RMasks[64]; extern Bitboard* RAttacks[64]; -extern uint64_t BMult[64]; -extern int BShift[64]; -extern Bitboard BMask[64]; +extern uint64_t BMagics[64]; +extern int BShifts[64]; +extern Bitboard BMasks[64]; extern Bitboard* BAttacks[64]; -extern Bitboard BishopPseudoAttacks[64]; -extern Bitboard RookPseudoAttacks[64]; -extern Bitboard QueenPseudoAttacks[64]; +extern Bitboard PseudoAttacks[6][64]; extern uint8_t BitCount8Bit[256]; @@ -84,11 +61,11 @@ inline Bitboard bit_is_set(Bitboard b, Square s) { return b & SetMaskBB[s]; } -inline void set_bit(Bitboard *b, Square s) { +inline void set_bit(Bitboard* b, Square s) { *b |= SetMaskBB[s]; } -inline void clear_bit(Bitboard *b, Square s) { +inline void clear_bit(Bitboard* b, Square s) { *b &= ClearMaskBB[s]; } @@ -100,7 +77,7 @@ inline Bitboard make_move_bb(Square from, Square to) { return SetMaskBB[from] | SetMaskBB[to]; } -inline void do_move_bb(Bitboard *b, Bitboard move_bb) { +inline void do_move_bb(Bitboard* b, Bitboard move_bb) { *b ^= move_bb; } @@ -125,27 +102,19 @@ inline Bitboard file_bb(Square s) { } -/// neighboring_files_bb takes a file or a square as input and returns a -/// bitboard representing all squares on the neighboring files. +/// adjacent_files_bb takes a file as input and returns a bitboard representing +/// all squares on the adjacent files. -inline Bitboard neighboring_files_bb(File f) { - return NeighboringFilesBB[f]; -} - -inline Bitboard neighboring_files_bb(Square s) { - return NeighboringFilesBB[file_of(s)]; +inline Bitboard adjacent_files_bb(File f) { + return AdjacentFilesBB[f]; } -/// this_and_neighboring_files_bb takes a file or a square as input and returns -/// a bitboard representing all squares on the given and neighboring files. - -inline Bitboard this_and_neighboring_files_bb(File f) { - return ThisAndNeighboringFilesBB[f]; -} +/// this_and_adjacent_files_bb takes a file as input and returns a bitboard +/// representing all squares on the given and adjacent files. -inline Bitboard this_and_neighboring_files_bb(Square s) { - return ThisAndNeighboringFilesBB[file_of(s)]; +inline Bitboard this_and_adjacent_files_bb(File f) { + return ThisAndAdjacentFilesBB[f]; } @@ -171,32 +140,34 @@ inline Bitboard in_front_bb(Color c, Square s) { #if defined(IS_64BIT) -inline Bitboard rook_attacks_bb(Square s, Bitboard occ) { - return RAttacks[s][((occ & RMask[s]) * RMult[s]) >> RShift[s]]; +FORCE_INLINE unsigned r_index(Square s, Bitboard occ) { + return unsigned(((occ & RMasks[s]) * RMagics[s]) >> RShifts[s]); } -inline Bitboard bishop_attacks_bb(Square s, Bitboard occ) { - return BAttacks[s][((occ & BMask[s]) * BMult[s]) >> BShift[s]]; +FORCE_INLINE unsigned b_index(Square s, Bitboard occ) { + return unsigned(((occ & BMasks[s]) * BMagics[s]) >> BShifts[s]); } #else // if !defined(IS_64BIT) -inline Bitboard rook_attacks_bb(Square s, Bitboard occ) { - Bitboard b = occ & RMask[s]; - return RAttacks[s] - [unsigned(int(b) * int(RMult[s]) ^ int(b >> 32) * int(RMult[s] >> 32)) >> RShift[s]]; +FORCE_INLINE unsigned r_index(Square s, Bitboard occ) { + Bitboard b = occ & RMasks[s]; + return unsigned(int(b) * int(RMagics[s]) ^ int(b >> 32) * int(RMagics[s] >> 32)) >> RShifts[s]; } -inline Bitboard bishop_attacks_bb(Square s, Bitboard occ) { - Bitboard b = occ & BMask[s]; - return BAttacks[s] - [unsigned(int(b) * int(BMult[s]) ^ int(b >> 32) * int(BMult[s] >> 32)) >> BShift[s]]; +FORCE_INLINE unsigned b_index(Square s, Bitboard occ) { + Bitboard b = occ & BMasks[s]; + return unsigned(int(b) * int(BMagics[s]) ^ int(b >> 32) * int(BMagics[s] >> 32)) >> BShifts[s]; } #endif -inline Bitboard queen_attacks_bb(Square s, Bitboard blockers) { - return rook_attacks_bb(s, blockers) | bishop_attacks_bb(s, blockers); +inline Bitboard rook_attacks_bb(Square s, Bitboard occ) { + return RAttacks[s][r_index(s, occ)]; +} + +inline Bitboard bishop_attacks_bb(Square s, Bitboard occ) { + return BAttacks[s][b_index(s, occ)]; } @@ -223,7 +194,7 @@ inline Bitboard squares_in_front_of(Color c, Square s) { /// passed_pawn_mask takes a color and a square as input, and returns a /// bitboard mask which can be used to test if a pawn of the given color on /// the given square is a passed pawn. Definition of the table is: -/// PassedPawnMask[c][s] = in_front_bb(c, s) & this_and_neighboring_files_bb(s) +/// PassedPawnMask[c][s] = in_front_bb(c, s) & this_and_adjacent_files_bb(s) inline Bitboard passed_pawn_mask(Color c, Square s) { return PassedPawnMask[c][s]; @@ -233,7 +204,7 @@ inline Bitboard passed_pawn_mask(Color c, Square s) { /// attack_span_mask takes a color and a square as input, and returns a bitboard /// representing all squares that can be attacked by a pawn of the given color /// when it moves along its file starting from the given square. Definition is: -/// AttackSpanMask[c][s] = in_front_bb(c, s) & neighboring_files_bb(s); +/// AttackSpanMask[c][s] = in_front_bb(c, s) & adjacent_files_bb(s); inline Bitboard attack_span_mask(Color c, Square s) { return AttackSpanMask[c][s]; @@ -249,6 +220,15 @@ inline bool squares_aligned(Square s1, Square s2, Square s3) { } +/// same_color_squares() returns a bitboard representing all squares with +/// the same color of the given square. + +inline Bitboard same_color_squares(Square s) { + return bit_is_set(0xAA55AA55AA55AA55ULL, s) ? 0xAA55AA55AA55AA55ULL + : ~0xAA55AA55AA55AA55ULL; +} + + /// 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. @@ -286,6 +266,6 @@ extern Square pop_1st_bit(Bitboard* b); extern void print_bitboard(Bitboard b); -extern void init_bitboards(); +extern void bitboards_init(); #endif // !defined(BITBOARD_H_INCLUDED)