X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fposition.h;h=488ed09f0a649b5dd4f9ff7e16904eea3497697b;hp=634fbc0d42ab680ada6b6569a70adf8d0aec7c5f;hb=7bc36887144bc6a682e54a91044641f913176449;hpb=bede30e7a658dbb5e013351c86f77c3fd4bc8537 diff --git a/src/position.h b/src/position.h index 634fbc0d..488ed09f 100644 --- a/src/position.h +++ b/src/position.h @@ -108,8 +108,7 @@ public: 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; @@ -128,6 +127,7 @@ public: // 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 @@ -185,21 +185,14 @@ public: Value non_pawn_material(Color c) const; Score pst_delta(Piece piece, Square from, Square to) const; - // Game termination checks - bool is_mate() const; + // Other properties of the position template bool is_draw() const; - - // Plies from start position to the beginning of search int startpos_ply_counter() const; - - // Other properties of the position 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); @@ -215,7 +208,7 @@ private: // Initialization helper functions (used while setting up a position) void clear(); void put_piece(Piece p, Square s); - void set_castle_right(Square ksq, Square rsq); + void set_castle_right(Color c, Square rfrom); bool move_is_legal(const Move m) const; // Helper template functions @@ -238,7 +231,6 @@ private: // Bitboards Bitboard byTypeBB[8]; // [pieceType] Bitboard byColorBB[2]; // [color] - Bitboard occupied; // Piece counts int pieceCount[2][8]; // [color][pieceType] @@ -250,6 +242,7 @@ private: // Other info int castleRightsMask[64]; // [square] Square castleRookSquare[16]; // [castleRight] + Bitboard castlePath[16]; // [castleRight] StateInfo startState; int64_t nodes; int startPosPly; @@ -261,7 +254,7 @@ private: // 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; @@ -291,12 +284,8 @@ inline Color Position::side_to_move() const { 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 { @@ -343,41 +332,32 @@ inline bool Position::can_castle(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(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 // Knight and King and white pawns +template inline Bitboard Position::attacks_from(Square s) const { - return StepAttacksBB[Piece][s]; -} - -template<> -inline Bitboard Position::attacks_from(Square s) const { - return bishop_attacks_bb(s, occupied_squares()); -} - -template<> -inline Bitboard Position::attacks_from(Square s) const { - return rook_attacks_bb(s, occupied_squares()); + return Pt == BISHOP || Pt == ROOK ? attacks_bb(s, pieces()) + : Pt == QUEEN ? attacks_from(s) | attacks_from(s) + : StepAttacksBB[Pt][s]; } template<> -inline Bitboard Position::attacks_from(Square s) const { - return attacks_from(s) | attacks_from(s); +inline Bitboard Position::attacks_from(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 { @@ -397,7 +377,7 @@ inline Bitboard Position::pinned_pieces() const { } inline bool Position::pawn_is_passed(Color c, Square s) const { - return !(pieces(PAWN, flip(c)) & passed_pawn_mask(c, s)); + return !(pieces(PAWN, ~c) & passed_pawn_mask(c, s)); } inline Key Position::key() const { @@ -449,6 +429,12 @@ inline bool Position::opposite_colored_bishops() 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)); }