kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-29 16:23:09 +00:00
Code Issues Releases Wiki Activity

Inline pinned_pieces() and discovered_check_candidates()

Browse source 
No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2011-10-30 18:16:28 +01:00
parent e7939f450f
commit 29be28e1a2
3 changed files with 19 additions and 27 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

26
src/position.cpp
View file

@ -349,7 +349,6 @@ void Position::print(Move move) const {
/// king) pieces for the given color. Or, when template parameter FindPinned is
/// false, the function return the pieces of the given color candidate for a
/// discovery check against the enemy king.
template<bool FindPinned>
Bitboard Position::hidden_checkers() const {
@ -373,24 +372,10 @@ Bitboard Position::hidden_checkers() const {
return result;
}
// Explicit template instantiations
template Bitboard Position::hidden_checkers<true>() const;
template Bitboard Position::hidden_checkers<false>() const;
/// Position:pinned_pieces() returns a bitboard of all pinned (against the
/// king) pieces for the side to move.
Bitboard Position::pinned_pieces() const {
return hidden_checkers<true>();
}
/// Position:discovered_check_candidates() returns a bitboard containing all
/// pieces for the side to move which are candidates for giving a discovered
/// check.
Bitboard Position::discovered_check_candidates() const {
return hidden_checkers<false>();
}
/// Position::attackers_to() computes a bitboard of all pieces which attacks a
/// given square. Slider attacks use occ bitboard as occupancy.
@ -405,6 +390,7 @@ Bitboard Position::attackers_to(Square s, Bitboard occ) const {
| (attacks_from<KING>(s) & pieces(KING));
}
/// Position::attacks_from() computes a bitboard of all attacks of a given piece
/// put in a given square. Slider attacks use occ bitboard as occupancy.
@ -503,8 +489,8 @@ bool Position::pl_move_is_legal(Move m, Bitboard pinned) const {
/// Position::move_is_legal() takes a random move and tests whether the move
/// is legal. This version is not very fast and should be used only
/// in non time-critical paths.
/// is legal. This version is not very fast and should be used only in non
/// time-critical paths.
bool Position::move_is_legal(const Move m) const {

14
src/position.h
View file

@ -216,11 +216,9 @@ private:
void set_castle_right(Square ksq, Square rsq);
bool move_is_legal(const Move m) const;
// Helper functions for doing and undoing moves
// Helper template functions
template<bool Do> void do_castle_move(Move m);
template<bool FindPinned>
Bitboard hidden_checkers() const;
template<bool FindPinned> Bitboard hidden_checkers() const;
// Computing hash keys from scratch (for initialization and debugging)
Key compute_key() const;
@ -384,6 +382,14 @@ inline bool Position::in_check() const {
return st->checkersBB != 0;
}
inline Bitboard Position::discovered_check_candidates() const {
return hidden_checkers<false>();
}
inline Bitboard Position::pinned_pieces() const {
return hidden_checkers<true>();
}
inline bool Position::pawn_is_passed(Color c, Square s) const {
return !(pieces(PAWN, flip(c)) & passed_pawn_mask(c, s));
}