X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fposition.h;h=981bad3e846f31cb8459efd82f5884ba5d17aa62;hp=5910e439650680770a222e0ac8f2c1f5c6e9ebe2;hb=0bf45823da3d76d25d0e3cfdf131bf8823ecb58e;hpb=038235ba3541087e2db969a0a4bdfd5fc2a42b44 diff --git a/src/position.h b/src/position.h index 5910e439..981bad3e 100644 --- a/src/position.h +++ b/src/position.h @@ -73,21 +73,20 @@ enum CastleRights { }; -/// The UndoInfo struct stores information we need to restore a Position -/// object to its previous state when we retract a move. Whenever a move -/// is made on the board (by calling Position::do_move), an UndoInfo object -/// must be passed as a parameter. When the move is unmade (by calling -/// Position::undo_move), the same UndoInfo object must be passed again. - -struct UndoInfo { - int castleRights; - Square epSquare; - Bitboard checkersBB; +/// The StateInfo struct stores information we need to restore a Position +/// object to its previous state when we retract a move. Whenever a move +/// is made on the board (by calling Position::do_move), an StateInfo object +/// must be passed as a parameter. + +struct StateInfo { + Bitboard pinners[2], pinned[2], dcCandidates[2], checkersBB; Key key, pawnKey, materialKey; - int rule50; + int castleRights, rule50; + Square epSquare; Move lastMove; - PieceType capture; Value mgValue, egValue; + PieceType capture; + StateInfo* previous; }; @@ -117,17 +116,18 @@ struct UndoInfo { class Position { friend class MaterialInfo; + friend class EndgameFunctions; public: // Constructors Position() {}; - Position(const Position &pos); - Position(const std::string &fen); + Position(const Position& pos); + Position(const std::string& fen); // Text input/output - void from_fen(const std::string &fen); + void from_fen(const std::string& fen); const std::string to_fen() const; - void print() const; + void print(Move m = MOVE_NONE) const; // Copying void copy(const Position &pos); @@ -173,13 +173,13 @@ public: // Number of pieces of each color and type int piece_count(Color c, PieceType pt) const; - // The en passant square: + // The en passant square Square ep_square() const; // Current king position for each color Square king_square(Color c) const; - // Castling rights. + // Castling rights bool can_castle_kingside(Color c) const; bool can_castle_queenside(Color c) const; bool can_castle(Color c) const; @@ -196,6 +196,7 @@ public: // Bitboards for pinned pieces and discovered check candidates Bitboard discovered_check_candidates(Color c) const; + Bitboard pinned_pieces(Color c, Bitboard& p) const; Bitboard pinned_pieces(Color c) const; // Checking pieces @@ -214,13 +215,11 @@ public: template 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 + bool piece_attacks_square(Piece p, Square f, Square t) const; // Dispatch at run-time // Properties of moves 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; bool move_is_deep_pawn_push(Move m) const; bool move_is_pawn_push_to_7th(Move m) const; @@ -241,17 +240,15 @@ public: bool square_is_weak(Square s, Color c) const; // Doing and undoing moves - void backup(UndoInfo &u) const; - void restore(const UndoInfo &u); - void do_move(Move m, UndoInfo &u); - void do_move(Move m, UndoInfo &u, Bitboard dcCandidates); - void undo_move(Move m, const UndoInfo &u); - void do_null_move(UndoInfo &u); - void undo_null_move(const UndoInfo &u); + void do_move(Move m, StateInfo& st); + void undo_move(Move m); + void do_null_move(StateInfo& st); + void undo_null_move(); // Static exchange evaluation int see(Square from, Square to) const; int see(Move m) const; + int see(Square to) const; // Accessing hash keys Key get_key() const; @@ -266,7 +263,7 @@ public: Value mg_pst_delta(Move m) const; // Game termination checks - bool is_mate(); + bool is_mate() const; bool is_draw() const; // Check if one side threatens a mate in one @@ -299,15 +296,19 @@ private: // Helper functions for doing and undoing moves void do_capture_move(Move m, PieceType capture, Color them, Square to); void do_castle_move(Move m); - void do_promotion_move(Move m, UndoInfo &u); + void do_promotion_move(Move m); void do_ep_move(Move m); void undo_castle_move(Move m); - void undo_promotion_move(Move m, const UndoInfo &u); + void undo_promotion_move(Move m); void undo_ep_move(Move m); void find_checkers(); + void find_pinned(); + + template + void update_checkers(Bitboard* pCheckersBB, Square ksq, Square from, Square to, Bitboard dcCandidates); template - Bitboard hidden_checks(Color c, Square ksq) const; + Bitboard hidden_checks(Color c, Square ksq, Bitboard& pinners) const; // Computing hash keys from scratch (for initialization and debugging) Key compute_key() const; @@ -315,15 +316,16 @@ private: Key compute_material_key() const; // Computing incremental evaluation scores and material counts - Value mg_pst(Color c, PieceType pt, Square s) const; - Value eg_pst(Color c, PieceType pt, Square s) const; - Value compute_mg_value() const; - Value compute_eg_value() const; + enum GamePhase { + MidGame, + EndGame + }; + template Value pst(Color c, PieceType pt, Square s) const; + template Value compute_value() const; Value compute_non_pawn_material(Color c) const; // Bitboards Bitboard byColorBB[2], byTypeBB[8]; - Bitboard checkersBB; // Board Piece board[64]; @@ -336,16 +338,14 @@ private: int index[64]; // Other info - Color sideToMove; - int castleRights; - File initialKFile, initialKRFile, initialQRFile; - Square epSquare; Square kingSquare[2]; - Move lastMove; - Key key, pawnKey, materialKey, history[MaxGameLength]; - int rule50, gamePly; - Value mgValue, egValue; + Color sideToMove; + int gamePly; + Key history[MaxGameLength]; Value npMaterial[2]; + File initialKFile, initialKRFile, initialQRFile; + StateInfo startState; + StateInfo* st; // Static variables static int castleRightsMask[64]; @@ -496,7 +496,7 @@ inline Square Position::piece_list(Color c, PieceType pt, int index) const { } inline Square Position::ep_square() const { - return epSquare; + return st->epSquare; } inline Square Position::king_square(Color c) const { @@ -504,11 +504,11 @@ inline Square Position::king_square(Color c) const { } inline bool Position::can_castle_kingside(Color side) const { - return castleRights & (1+int(side)); + return st->castleRights & (1+int(side)); } inline bool Position::can_castle_queenside(Color side) const { - return castleRights & (4+4*int(side)); + return st->castleRights & (4+4*int(side)); } inline bool Position::can_castle(Color side) const { @@ -524,7 +524,12 @@ inline Square Position::initial_qr_square(Color c) const { } inline Bitboard Position::pawn_attacks(Color c, Square s) const { - return StepAttackBB[pawn_of_color(c)][s]; + return StepAttackBB[piece_of_color_and_type(c, PAWN)][s]; +} + +template<> +inline Bitboard Position::piece_attacks(Square s) const { + return StepAttackBB[piece_of_color_and_type(opposite_color(sideToMove), PAWN)][s]; } template<> @@ -552,12 +557,25 @@ inline Bitboard Position::piece_attacks(Square s) const { return StepAttackBB[KING][s]; } +inline Bitboard Position::pinned_pieces(Color c) const { + return st->pinned[c]; +} + +inline Bitboard Position::pinned_pieces(Color c, Bitboard& p) const { + p = st->pinners[c]; + return st->pinned[c]; +} + +inline Bitboard Position::discovered_check_candidates(Color c) const { + return st->dcCandidates[c]; +} + inline Bitboard Position::checkers() const { - return checkersBB; + return st->checkersBB; } inline bool Position::is_check() const { - return checkersBB != EmptyBoardBB; + return st->checkersBB != EmptyBoardBB; } inline bool Position::pawn_attacks_square(Color c, Square f, Square t) const { @@ -569,6 +587,16 @@ Bitboard Position::piece_attacks_square(Square f, Square t) const { return bit_is_set(piece_attacks(f), t); } +inline Bitboard Position::attacks_to(Square s, Color c) const { + + return attacks_to(s) & pieces_of_color(c); +} + +inline bool Position::square_is_attacked(Square s, Color c) const { + + return attacks_to(s, c) != EmptyBoardBB; +} + inline bool Position::pawn_is_passed(Color c, Square s) const { return !(pawns(opposite_color(c)) & passed_pawn_mask(c, s)); } @@ -594,19 +622,21 @@ inline bool Position::square_is_weak(Square s, Color c) const { } inline Key Position::get_key() const { - return key; + return st->key; } inline Key Position::get_pawn_key() const { - return pawnKey; + return st->pawnKey; } inline Key Position::get_material_key() const { - return materialKey; + return st->materialKey; } -inline Value Position::mg_pst(Color c, PieceType pt, Square s) const { - return MgPieceSquareTable[piece_of_color_and_type(c, pt)][s]; +template +inline Value Position::pst(Color c, PieceType pt, Square s) const { + return (Phase == MidGame ? MgPieceSquareTable[piece_of_color_and_type(c, pt)][s] + : EgPieceSquareTable[piece_of_color_and_type(c, pt)][s]); } inline Value Position::mg_pst_delta(Move m) const { @@ -614,16 +644,12 @@ inline Value Position::mg_pst_delta(Move m) const { -MgPieceSquareTable[piece_on(move_from(m))][move_from(m)]; } -inline Value Position::eg_pst(Color c, PieceType pt, Square s) const { - return EgPieceSquareTable[piece_of_color_and_type(c, pt)][s]; -} - inline Value Position::mg_value() const { - return mgValue; + return st->mgValue; } inline Value Position::eg_value() const { - return egValue; + return st->egValue; } inline Value Position::non_pawn_material(Color c) const { @@ -655,34 +681,34 @@ inline Phase Position::game_phase() const { inline bool Position::move_is_deep_pawn_push(Move m) const { Color c = side_to_move(); - return piece_on(move_from(m)) == pawn_of_color(c) + return piece_on(move_from(m)) == piece_of_color_and_type(c, PAWN) && relative_rank(c, move_to(m)) > RANK_4; } inline bool Position::move_is_pawn_push_to_7th(Move m) const { Color c = side_to_move(); - return piece_on(move_from(m)) == pawn_of_color(c) + return piece_on(move_from(m)) == piece_of_color_and_type(c, PAWN) && relative_rank(c, move_to(m)) == RANK_7; } inline bool Position::move_is_passed_pawn_push(Move m) const { Color c = side_to_move(); - return piece_on(move_from(m)) == pawn_of_color(c) + return piece_on(move_from(m)) == piece_of_color_and_type(c, PAWN) && pawn_is_passed(c, move_to(m)); } inline bool Position::move_was_passed_pawn_push(Move m) const { Color c = opposite_color(side_to_move()); - return piece_on(move_to(m)) == pawn_of_color(c) + return piece_on(move_to(m)) == piece_of_color_and_type(c, PAWN) && pawn_is_passed(c, move_to(m)); } inline int Position::rule_50_counter() const { - return rule50; + return st->rule50; } inline bool Position::opposite_colored_bishops() const {