Color side_to_move() const;
// Bitboard representation of the position
- Bitboard empty_squares() const;
- Bitboard occupied_squares() const;
+ Bitboard pieces() const;
Bitboard pieces(Color c) const;
Bitboard pieces(PieceType pt) const;
Bitboard pieces(PieceType pt, Color c) const;
// Castling rights
bool can_castle(CastleRight f) const;
bool can_castle(Color c) const;
+ bool castle_impeded(CastleRight f) const;
Square castle_rook_square(CastleRight f) const;
// Bitboards for pinned pieces and discovered check candidates
template<bool SkipRepetition> bool is_draw() const;
int startpos_ply_counter() const;
bool opposite_colored_bishops() const;
+ bool both_color_bishops(Color c) const;
bool has_pawn_on_7th(Color c) const;
bool is_chess960() const;
-
- // Current thread ID searching on the position
int thread() const;
-
int64_t nodes_searched() const;
void set_nodes_searched(int64_t n);
// Initialization helper functions (used while setting up a position)
void clear();
void put_piece(Piece p, Square s);
- void set_castle_right(Color c, Square rsq);
+ void set_castle_right(Color c, Square rfrom);
bool move_is_legal(const Move m) const;
// Helper template functions
// Bitboards
Bitboard byTypeBB[8]; // [pieceType]
Bitboard byColorBB[2]; // [color]
- Bitboard occupied;
// Piece counts
int pieceCount[2][8]; // [color][pieceType]
// Other info
int castleRightsMask[64]; // [square]
Square castleRookSquare[16]; // [castleRight]
+ Bitboard castlePath[16]; // [castleRight]
StateInfo startState;
int64_t nodes;
int startPosPly;
// Static variables
static Score pieceSquareTable[16][64]; // [piece][square]
static Key zobrist[2][8][64]; // [color][pieceType][square]/[piece count]
- static Key zobEp[64]; // [square]
+ static Key zobEp[8]; // [file]
static Key zobCastle[16]; // [castleRight]
static Key zobSideToMove;
static Key zobExclusion;
return sideToMove;
}
-inline Bitboard Position::occupied_squares() const {
- return occupied;
-}
-
-inline Bitboard Position::empty_squares() const {
- return ~occupied;
+inline Bitboard Position::pieces() const {
+ return byTypeBB[ALL_PIECES];
}
inline Bitboard Position::pieces(Color c) const {
return st->castleRights & ((WHITE_OO | WHITE_OOO) << c);
}
-inline Square Position::castle_rook_square(CastleRight f) const {
- return castleRookSquare[f];
+inline bool Position::castle_impeded(CastleRight f) const {
+ return byTypeBB[ALL_PIECES] & castlePath[f];
}
-template<>
-inline Bitboard Position::attacks_from<PAWN>(Square s, Color c) const {
- return StepAttacksBB[make_piece(c, PAWN)][s];
+inline Square Position::castle_rook_square(CastleRight f) const {
+ return castleRookSquare[f];
}
-template<PieceType Piece> // Knight and King and white pawns
+template<PieceType Pt>
inline Bitboard Position::attacks_from(Square s) const {
- return StepAttacksBB[Piece][s];
+ return Pt == BISHOP || Pt == ROOK ? attacks_bb<Pt>(s, pieces())
+ : Pt == QUEEN ? attacks_from<ROOK>(s) | attacks_from<BISHOP>(s)
+ : StepAttacksBB[Pt][s];
}
template<>
-inline Bitboard Position::attacks_from<BISHOP>(Square s) const {
- return bishop_attacks_bb(s, occupied_squares());
-}
-
-template<>
-inline Bitboard Position::attacks_from<ROOK>(Square s) const {
- return rook_attacks_bb(s, occupied_squares());
-}
-
-template<>
-inline Bitboard Position::attacks_from<QUEEN>(Square s) const {
- return attacks_from<ROOK>(s) | attacks_from<BISHOP>(s);
+inline Bitboard Position::attacks_from<PAWN>(Square s, Color c) const {
+ return StepAttacksBB[make_piece(c, PAWN)][s];
}
inline Bitboard Position::attacks_from(Piece p, Square s) const {
- return attacks_from(p, s, occupied_squares());
+ return attacks_from(p, s, byTypeBB[ALL_PIECES]);
}
inline Bitboard Position::attackers_to(Square s) const {
- return attackers_to(s, occupied_squares());
+ return attackers_to(s, byTypeBB[ALL_PIECES]);
}
inline Bitboard Position::checkers() const {
&& opposite_colors(pieceList[WHITE][BISHOP][0], pieceList[BLACK][BISHOP][0]);
}
+inline bool Position::both_color_bishops(Color c) const {
+ // Assumes that there are only two bishops
+ return pieceCount[c][BISHOP] >= 2 &&
+ opposite_colors(pieceList[c][BISHOP][0], pieceList[c][BISHOP][1]);
+}
+
inline bool Position::has_pawn_on_7th(Color c) const {
return pieces(PAWN, c) & rank_bb(relative_rank(c, RANK_7));
}