/*
- Glaurung, a UCI chess playing engine.
- Copyright (C) 2004-2008 Tord Romstad
+ Stockfish, a UCI chess playing engine derived from Glaurung 2.1
+ Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
+ Copyright (C) 2008 Marco Costalba
- Glaurung is free software: you can redistribute it and/or modify
+ Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
- Glaurung is distributed in the hope that it will be useful,
+ Stockfish is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
// Number of pieces of each color and type
int piece_count(Color c, PieceType pt) const;
- int pawn_count(Color c) const;
- int knight_count(Color c) const;
- int bishop_count(Color c) const;
- int rook_count(Color c) const;
- int queen_count(Color c) const;
// The en passant square:
Square ep_square() const;
Bitboard attacks_to(Square s) const;
Bitboard attacks_to(Square s, Color c) const;
bool is_check() const;
- bool piece_attacks_square(Square f, Square t) const;
- bool white_pawn_attacks_square(Square f, Square t) const;
- bool black_pawn_attacks_square(Square f, Square t) const;
- bool knight_attacks_square(Square f, Square t) const;
- bool bishop_attacks_square(Square f, Square t) const;
- bool rook_attacks_square(Square f, Square t) const;
- bool queen_attacks_square(Square f, Square t) const;
- bool king_attacks_square(Square f, Square t) const;
+ bool pawn_attacks_square(Color c, Square f, Square t) const;
+
+ template<PieceType>
+ Bitboard piece_attacks_square(Square f, Square t) const; // Dispatch at compile-time
+
+ bool piece_attacks_square(Square f, Square t) const; // Dispatch at run-time
// Properties of moves
- bool move_is_legal(Move m) const;
- bool move_is_legal(Move m, Bitboard pinned) const;
+ bool pl_move_is_legal(Move m) const;
+ bool pl_move_is_legal(Move m, Bitboard pinned) const;
bool move_is_check(Move m) const;
bool move_is_check(Move m, Bitboard dcCandidates) const;
bool move_is_capture(Move m) const;
void undo_ep_move(Move m);
void find_checkers();
+ template<PieceType Piece, bool FindPinned>
+ Bitboard hidden_checks(Color c, Square ksq) const;
+
// Computing hash keys from scratch (for initialization and debugging)
Key compute_key() const;
Key compute_pawn_key() const;
return pieceCount[c][pt];
}
-inline int Position::pawn_count(Color c) const {
- return piece_count(c, PAWN);
-}
-
-inline int Position::knight_count(Color c) const {
- return piece_count(c, KNIGHT);
-}
-
-inline int Position::bishop_count(Color c) const {
- return piece_count(c, BISHOP);
-}
-
-inline int Position::rook_count(Color c) const {
- return piece_count(c, ROOK);
-}
-
-inline int Position::queen_count(Color c) const {
- return piece_count(c, QUEEN);
-}
-
inline Square Position::piece_list(Color c, PieceType pt, int index) const {
return pieceList[c][pt][index];
}
}
inline bool Position::is_check() const {
- return checkers() != EmptyBoardBB;
-}
-
-inline bool Position::white_pawn_attacks_square(Square f, Square t) const {
- return bit_is_set(pawn_attacks(WHITE, f), t);
-}
-
-inline bool Position::black_pawn_attacks_square(Square f, Square t) const {
- return bit_is_set(pawn_attacks(BLACK, f), t);
-}
-
-inline bool Position::knight_attacks_square(Square f, Square t) const {
- return bit_is_set(piece_attacks<KNIGHT>(f), t);
-}
-
-inline bool Position::bishop_attacks_square(Square f, Square t) const {
- return bit_is_set(piece_attacks<BISHOP>(f), t);
-}
-
-inline bool Position::rook_attacks_square(Square f, Square t) const {
- return bit_is_set(piece_attacks<ROOK>(f), t);
+ return checkersBB != EmptyBoardBB;
}
-inline bool Position::queen_attacks_square(Square f, Square t) const {
- return bit_is_set(piece_attacks<QUEEN>(f), t);
+inline bool Position::pawn_attacks_square(Color c, Square f, Square t) const {
+ return bit_is_set(pawn_attacks(c, f), t);
}
-inline bool Position::king_attacks_square(Square f, Square t) const {
- return bit_is_set(piece_attacks<KING>(f), t);
+template<PieceType Piece>
+Bitboard Position::piece_attacks_square(Square f, Square t) const {
+ return bit_is_set(piece_attacks<Piece>(f), t);
}
inline bool Position::pawn_is_passed(Color c, Square s) const {
inline bool Position::opposite_colored_bishops() const {
- return bishop_count(WHITE) == 1
- && bishop_count(BLACK) == 1
+ return piece_count(WHITE, BISHOP) == 1
+ && piece_count(BLACK, BISHOP) == 1
&& square_color(piece_list(WHITE, BISHOP, 0)) != square_color(piece_list(BLACK, BISHOP, 0));
}