X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fposition.h;h=b05d466ecbe05eb3fb3c221a9f5546793f045bf7;hp=ce636fe390b80ddd1162f1aea8ff0e63c2f47491;hb=588670e8d2ed5735300c5549ef754ceb09f1f461;hpb=0587c5b605fc9f0c23dab3a890b2986276c259cb diff --git a/src/position.h b/src/position.h index ce636fe3..b05d466e 100644 --- a/src/position.h +++ b/src/position.h @@ -21,6 +21,7 @@ #define POSITION_H_INCLUDED #include +#include #include "bitboard.h" #include "types.h" @@ -29,7 +30,7 @@ /// The checkInfo struct is initialized at c'tor time and keeps info used /// to detect if a move gives check. class Position; -class Thread; +struct Thread; struct CheckInfo { @@ -44,7 +45,7 @@ struct CheckInfo { /// 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 +/// is made on the board (by calling Position::do_move), a StateInfo object /// must be passed as a parameter. struct StateInfo { @@ -60,13 +61,10 @@ struct StateInfo { StateInfo* previous; }; -struct ReducedStateInfo { - Key pawnKey, materialKey; - Value npMaterial[COLOR_NB]; - int castleRights, rule50, pliesFromNull; - Score psqScore; - Square epSquare; -}; + +/// When making a move the current StateInfo up to 'key' excluded is copied to +/// the new one. Here we calculate the quad words (64bits) needed to be copied. +const size_t StateCopySize64 = offsetof(StateInfo, key) / sizeof(uint64_t) + 1; /// The position data structure. A position consists of the following data: @@ -95,13 +93,13 @@ class Position { public: Position() {} Position(const Position& p, Thread* t) { *this = p; thisThread = t; } - Position(const std::string& f, bool c960, Thread* t) { from_fen(f, c960, t); } + Position(const std::string& f, bool c960, Thread* t) { set(f, c960, t); } Position& operator=(const Position&); // Text input/output - void from_fen(const std::string& fen, bool isChess960, Thread* th); - const std::string to_fen() const; - void print(Move m = MOVE_NONE) const; + void set(const std::string& fen, bool isChess960, Thread* th); + const std::string fen() const; + const std::string pretty(Move m = MOVE_NONE) const; // Position representation Bitboard pieces() const; @@ -124,7 +122,6 @@ public: Square castle_rook_square(Color c, CastlingSide s) const; // Checking - bool in_check() const; Bitboard checkers() const; Bitboard discovered_check_candidates() const; Bitboard pinned_pieces() const; @@ -139,8 +136,6 @@ public: // Properties of moves bool move_gives_check(Move m, const CheckInfo& ci) const; - bool move_attacks_square(Move m, Square s) const; - bool move_is_legal(const Move m) const; bool pl_move_is_legal(Move m, Bitboard pinned) const; bool is_pseudo_legal(const Move m) const; bool is_capture(Move m) const; @@ -183,7 +178,7 @@ public: Thread* this_thread() const; int64_t nodes_searched() const; void set_nodes_searched(int64_t n); - template bool is_draw() const; + template bool is_draw() const; // Position consistency check, for debugging bool pos_is_ok(int* failedStep = NULL) const; @@ -334,10 +329,6 @@ inline Bitboard Position::checkers() const { return st->checkersBB; } -inline bool Position::in_check() const { - return st->checkersBB != 0; -} - inline Bitboard Position::discovered_check_candidates() const { return hidden_checkers(); }