#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 PassedPawnMask[2][64];
extern Bitboard AttackSpanMask[2][64];
+extern uint64_t RMagics[64];
+extern int RShifts[64];
+extern Bitboard RMasks[64];
+extern Bitboard* RAttacks[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 uint8_t BitCount8Bit[256];
-struct Magics {
- Bitboard mask;
- uint64_t mult;
- uint32_t shift;
- Bitboard* attacks;
-};
-
-extern Magics RMagics[64];
-extern Magics BMagics[64];
-
/// Functions for testing whether a given bit is set in a bitboard, and for
/// setting and clearing bits.
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];
}
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;
}
}
inline Bitboard rank_bb(Square s) {
- return RankBB[square_rank(s)];
+ return RankBB[rank_of(s)];
}
inline Bitboard file_bb(File f) {
}
inline Bitboard file_bb(Square s) {
- return FileBB[square_file(s)];
+ return FileBB[file_of(s)];
}
-/// neighboring_files_bb takes a file or a square as input and returns a
-/// bitboard representing all squares on the neighboring files.
+/// neighboring_files_bb takes a file as input and returns a bitboard representing
+/// all squares on the neighboring files.
inline Bitboard neighboring_files_bb(File f) {
return NeighboringFilesBB[f];
}
-inline Bitboard neighboring_files_bb(Square s) {
- return NeighboringFilesBB[square_file(s)];
-}
-
-/// 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.
+/// this_and_neighboring_files_bb takes a file 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];
}
-inline Bitboard this_and_neighboring_files_bb(Square s) {
- return ThisAndNeighboringFilesBB[square_file(s)];
-}
-
/// in_front_bb() takes a color and a rank or square as input, and returns a
/// bitboard representing all the squares on all ranks in front of the rank
}
inline Bitboard in_front_bb(Color c, Square s) {
- return InFrontBB[c][square_rank(s)];
+ return InFrontBB[c][rank_of(s)];
}
#if defined(IS_64BIT)
-inline Bitboard rook_attacks_bb(Square s, Bitboard occ) {
- const Magics& m = RMagics[s];
- return m.attacks[((occ & m.mask) * m.mult) >> m.shift];
+FORCE_INLINE unsigned rook_index(Square s, Bitboard occ) {
+ return unsigned(((occ & RMasks[s]) * RMagics[s]) >> RShifts[s]);
}
-inline Bitboard bishop_attacks_bb(Square s, Bitboard occ) {
- const Magics& m = BMagics[s];
- return m.attacks[((occ & m.mask) * m.mult) >> m.shift];
+FORCE_INLINE unsigned bishop_index(Square s, Bitboard occ) {
+ return unsigned(((occ & BMasks[s]) * BMagics[s]) >> BShifts[s]);
}
#else // if !defined(IS_64BIT)
+FORCE_INLINE unsigned rook_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];
+}
+
+FORCE_INLINE unsigned bishop_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 rook_attacks_bb(Square s, Bitboard occ) {
- const Magics& m = RMagics[s];
- Bitboard b = occ & m.mask;
- return m.attacks[(unsigned(b) * unsigned(m.mult) ^ unsigned(b >> 32) * unsigned(m.mult >> 32)) >> m.shift];
+ return RAttacks[s][rook_index(s, occ)];
}
inline Bitboard bishop_attacks_bb(Square s, Bitboard occ) {
- const Magics& m = BMagics[s];
- Bitboard b = occ & m.mask;
- return m.attacks[(unsigned(b) * unsigned(m.mult) ^ unsigned(b >> 32) * unsigned(m.mult >> 32)) >> m.shift];
+ return BAttacks[s][bishop_index(s, occ)];
}
-#endif
-
inline Bitboard queen_attacks_bb(Square s, Bitboard blockers) {
return rook_attacks_bb(s, blockers) | bishop_attacks_bb(s, blockers);
}
inline bool squares_aligned(Square s1, Square s2, Square s3) {
return (BetweenBB[s1][s2] | BetweenBB[s1][s3] | BetweenBB[s2][s3])
- & ((1ULL << s1) | (1ULL << s2) | (1ULL << s3));
+ & ( SetMaskBB[s1] | SetMaskBB[s2] | SetMaskBB[s3]);
}
extern void print_bitboard(Bitboard b);
-extern void init_bitboards();
+extern void bitboards_init();
#endif // !defined(BITBOARD_H_INCLUDED)