/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2009 Marco Costalba
+ Copyright (C) 2008-2010 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
extern Bitboard RayBB[64][8];
extern Bitboard BetweenBB[64][64];
+extern Bitboard SquaresInFrontMask[2][64];
extern Bitboard PassedPawnMask[2][64];
extern Bitboard OutpostMask[2][64];
extern Bitboard RookPseudoAttacks[64];
extern Bitboard QueenPseudoAttacks[64];
+extern uint8_t BitCount8Bit[256];
+
////
//// Inline functions
}
inline Bitboard neighboring_files_bb(Square s) {
- return neighboring_files_bb(square_file(s));
+ return NeighboringFilesBB[square_file(s)];
}
}
inline Bitboard this_and_neighboring_files_bb(Square s) {
- return this_and_neighboring_files_bb(square_file(s));
+ return ThisAndNeighboringFilesBB[square_file(s)];
}
}
inline Bitboard in_front_bb(Color c, Square s) {
- return in_front_bb(c, square_rank(s));
+ return InFrontBB[c][square_rank(s)];
}
}
inline Bitboard behind_bb(Color c, Square s) {
- return in_front_bb(opposite_color(c), square_rank(s));
+ return InFrontBB[opposite_color(c)][square_rank(s)];
}
/// squares_in_front_of takes a color and a square as input, and returns a
/// bitboard representing all squares along the line in front of the square,
-/// from the point of view of the given color. For instance,
-/// squares_in_front_of(BLACK, SQ_E4) returns a bitboard with the squares
-/// e3, e2 and e1 set.
+/// from the point of view of the given color. Definition of the table is:
+/// SquaresInFrontOf[c][s] = in_front_bb(c, s) & file_bb(s)
inline Bitboard squares_in_front_of(Color c, Square s) {
- return in_front_bb(c, s) & file_bb(s);
+ return SquaresInFrontMask[c][s];
}
/// behind the square instead of in front of the square.
inline Bitboard squares_behind(Color c, Square s) {
- return in_front_bb(opposite_color(c), s) & file_bb(s);
+ return SquaresInFrontMask[opposite_color(c)][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.
+/// 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)
inline Bitboard passed_pawn_mask(Color c, Square s) {
return PassedPawnMask[c][s];
/// outpost_mask takes a color and a square as input, and returns a bitboard
/// mask which can be used to test whether a piece on the square can possibly
-/// be driven away by an enemy pawn.
+/// be driven away by an enemy pawn. Definition of the table is:
+/// OutpostMask[c][s] = in_front_bb(c, s) & neighboring_files_bb(s);
inline Bitboard outpost_mask(Color c, Square s) {
return OutpostMask[c][s];
}
-/// isolated_pawn_mask takes a square as input, and returns a bitboard mask
-/// which can be used to test whether a pawn on the given square is isolated.
-
-inline Bitboard isolated_pawn_mask(Square s) {
- return neighboring_files_bb(s);
-}
-
-
/// 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(USE_BSFQ) // Assembly code by Heinz van Saanen
-inline Square __attribute__((always_inline)) first_1(Bitboard b) {
+inline Square first_1(Bitboard b) {
Bitboard dummy;
__asm__("bsfq %1, %0": "=r"(dummy): "rm"(b) );
return (Square)(dummy);
}
-inline Square __attribute__((always_inline)) pop_1st_bit(Bitboard* b) {
+inline Square pop_1st_bit(Bitboard* b) {
const Square s = first_1(*b);
*b &= ~(1ULL<<s);
return s;
extern void print_bitboard(Bitboard b);
extern void init_bitboards();
+extern int bitScanReverse32(uint32_t b);
#endif // !defined(BITBOARD_H_INCLUDED)