X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fposition.h;h=9f694a79b25828a476f9aad6b776c95db727981a;hb=HEAD;hp=06ef6ab1f324868d11c01f727098e6728ac23a37;hpb=018022b8666200dacd3533e215e2de41f93df9da;p=stockfish diff --git a/src/position.h b/src/position.h index 06ef6ab1..ce03c34f 100644 --- a/src/position.h +++ b/src/position.h @@ -1,7 +1,6 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 - Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2004-2023 The Stockfish developers (see AUTHORS file) Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by @@ -17,536 +16,353 @@ along with this program. If not, see . */ -#if !defined(POSITION_H_INCLUDED) +#ifndef POSITION_H_INCLUDED #define POSITION_H_INCLUDED #include +#include +#include +#include +#include #include "bitboard.h" -#include "move.h" +#include "nnue/nnue_accumulator.h" #include "types.h" -/// Maximum number of plies per game (220 should be enough, because the -/// maximum search depth is 100, and during position setup we reset the -/// move counter for every non-reversible move). -const int MaxGameLength = 220; +namespace Stockfish { -class Position; +// StateInfo struct stores information needed 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), a StateInfo object must be passed. -/// struct checkInfo is initialized at c'tor time and keeps -/// info used to detect if a move gives check. - -struct CheckInfo { - - explicit CheckInfo(const Position&); +struct StateInfo { - Bitboard dcCandidates; - Bitboard pinned; - Bitboard checkSq[8]; - Square ksq; + // Copied when making a move + Key materialKey; + Key pawnKey; + Value nonPawnMaterial[COLOR_NB]; + int castlingRights; + int rule50; + int pliesFromNull; + Square epSquare; + + // Not copied when making a move (will be recomputed anyhow) + Key key; + Bitboard checkersBB; + StateInfo* previous; + Bitboard blockersForKing[COLOR_NB]; + Bitboard pinners[COLOR_NB]; + Bitboard checkSquares[PIECE_TYPE_NB]; + Piece capturedPiece; + int repetition; + + // Used by NNUE + Eval::NNUE::Accumulator accumulator; + DirtyPiece dirtyPiece; }; -/// Castle rights, encoded as bit fields - -enum CastleRights { - CASTLES_NONE = 0, - WHITE_OO = 1, - BLACK_OO = 2, - WHITE_OOO = 4, - BLACK_OOO = 8, - ALL_CASTLES = 15 -}; -/// Game phase -enum Phase { - PHASE_ENDGAME = 0, - PHASE_MIDGAME = 128 -}; +// A list to keep track of the position states along the setup moves (from the +// start position to the position just before the search starts). Needed by +// 'draw by repetition' detection. Use a std::deque because pointers to +// elements are not invalidated upon list resizing. +using StateListPtr = std::unique_ptr>; -/// 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 { - Key pawnKey, materialKey; - int castleRights, rule50, gamePly, pliesFromNull; - Square epSquare; - Score value; - Value npMaterial[2]; - - PieceType capturedType; - Key key; - Bitboard checkersBB; - StateInfo* previous; -}; - - -/// The position data structure. A position consists of the following data: -/// -/// * For each piece type, a bitboard representing the squares occupied -/// by pieces of that type. -/// * For each color, a bitboard representing the squares occupied by -/// pieces of that color. -/// * A bitboard of all occupied squares. -/// * A bitboard of all checking pieces. -/// * A 64-entry array of pieces, indexed by the squares of the board. -/// * The current side to move. -/// * Information about the castling rights for both sides. -/// * The initial files of the kings and both pairs of rooks. This is -/// used to implement the Chess960 castling rules. -/// * The en passant square (which is SQ_NONE if no en passant capture is -/// possible). -/// * The squares of the kings for both sides. -/// * Hash keys for the position itself, the current pawn structure, and -/// the current material situation. -/// * Hash keys for all previous positions in the game for detecting -/// repetition draws. -/// * A counter for detecting 50 move rule draws. +// Position class stores information regarding the board representation as +// pieces, side to move, hash keys, castling info, etc. Important methods are +// do_move() and undo_move(), used by the search to update node info when +// traversing the search tree. +class Thread; class Position { - - Position(); // No default or copy c'tor allowed - Position(const Position& pos); - -public: - enum GamePhase { - MidGame, - EndGame - }; - - // Constructors - Position(const Position& pos, int threadID); - Position(const std::string& fen, bool isChess960, int threadID); - - // Text input/output - void from_fen(const std::string& fen, bool isChess960); - const std::string to_fen() const; - void print(Move m = MOVE_NONE) const; - - // Copying - void flip(); - - // The piece on a given square - Piece piece_on(Square s) const; - PieceType type_of_piece_on(Square s) const; - Color color_of_piece_on(Square s) const; - bool square_is_empty(Square s) const; - bool square_is_occupied(Square s) const; - Value midgame_value_of_piece_on(Square s) const; - Value endgame_value_of_piece_on(Square s) const; - - // Side to move - Color side_to_move() const; - - // Bitboard representation of the position - Bitboard empty_squares() const; - Bitboard occupied_squares() const; - Bitboard pieces_of_color(Color c) const; - Bitboard pieces(PieceType pt) const; - Bitboard pieces(PieceType pt, Color c) const; - Bitboard pieces(PieceType pt1, PieceType pt2) const; - Bitboard pieces(PieceType pt1, PieceType pt2, Color c) const; - - // Number of pieces of each color and type - int piece_count(Color c, PieceType pt) const; - - // The en passant square - Square ep_square() const; - - // Current king position for each color - Square king_square(Color c) const; - - // Castling rights - bool can_castle_kingside(Color c) const; - bool can_castle_queenside(Color c) const; - bool can_castle(Color c) const; - Square initial_kr_square(Color c) const; - Square initial_qr_square(Color c) const; - - // Bitboards for pinned pieces and discovered check candidates - Bitboard discovered_check_candidates(Color c) const; - Bitboard pinned_pieces(Color c) const; - - // Checking pieces and under check information - Bitboard checkers() const; - bool in_check() const; - - // Piece lists - Square piece_list(Color c, PieceType pt, int index) const; - const Square* piece_list_begin(Color c, PieceType pt) const; - - // Information about attacks to or from a given square - Bitboard attackers_to(Square s) const; - Bitboard attackers_to(Square s, Bitboard occ) const; - Bitboard attacks_from(Piece p, Square s) const; - static Bitboard attacks_from(Piece p, Square s, Bitboard occ); - template Bitboard attacks_from(Square s) const; - template Bitboard attacks_from(Square s, Color c) const; - - // Properties of moves - bool pl_move_is_legal(Move m, Bitboard pinned) const; - bool move_is_pl(const Move m) const; - bool move_gives_check(Move m, const CheckInfo& ci) const; - bool move_is_capture(Move m) const; - bool move_is_passed_pawn_push(Move m) const; - bool move_attacks_square(Move m, Square s) const; - - // Piece captured with previous moves - PieceType captured_piece_type() const; - - // Information about pawns - bool pawn_is_passed(Color c, Square s) const; - - // Weak squares - bool square_is_weak(Square s, Color c) const; - - // Doing and undoing moves - void do_setup_move(Move m); - void do_move(Move m, StateInfo& st); - void do_move(Move m, StateInfo& st, const CheckInfo& ci, bool moveIsCheck); - void undo_move(Move m); - void do_null_move(StateInfo& st); - void undo_null_move(); - - // Static exchange evaluation - int see(Move m) const; - int see_sign(Move m) const; - static int see_value(PieceType pt); - - // Accessing hash keys - Key get_key() const; - Key get_exclusion_key() const; - Key get_pawn_key() const; - Key get_material_key() const; - - // Incremental evaluation - Score value() const; - Value non_pawn_material(Color c) const; - static Score pst_delta(Piece piece, Square from, Square to); - - // Game termination checks - bool is_mate() const; - template bool is_draw() const; - - // Number of plies from starting position - int startpos_ply_counter() const; - - // Other properties of the position - bool opposite_colored_bishops() 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); - - // Position consistency check, for debugging - bool is_ok(int* failedStep = NULL) const; - - // Global initialization - static void init(); - -private: - - // Initialization helper functions (used while setting up a position) - void clear(); - void detach(); - void put_piece(Piece p, Square s); - void set_castle_kingside(Color c); - void set_castle_queenside(Color c); - bool set_castling_rights(char token); - bool move_is_pl_slow(const Move m) const; - - // Helper functions for doing and undoing moves - void do_capture_move(Key& key, PieceType capture, Color them, Square to, bool ep); - void do_castle_move(Move m); - void undo_castle_move(Move m); - void find_checkers(); - - template - Bitboard hidden_checkers(Color c) const; - - // Computing hash keys from scratch (for initialization and debugging) - Key compute_key() const; - Key compute_pawn_key() const; - Key compute_material_key() const; - - // Computing incremental evaluation scores and material counts - static Score pst(Color c, PieceType pt, Square s); - Score compute_value() const; - Value compute_non_pawn_material(Color c) const; - - // Board - Piece board[64]; - - // Bitboards - Bitboard byTypeBB[8], byColorBB[2]; - - // Piece counts - int pieceCount[2][8]; // [color][pieceType] - - // Piece lists - Square pieceList[2][8][16]; // [color][pieceType][index] - int index[64]; // [square] - - // Other info - Color sideToMove; - Key history[MaxGameLength]; - int castleRightsMask[64]; - StateInfo startState; - File initialKFile, initialKRFile, initialQRFile; - bool chess960; - int startPosPlyCounter; - int threadID; - int64_t nodes; - StateInfo* st; - - // Static variables - static Key zobrist[2][8][64]; - static Key zobEp[64]; - static Key zobCastle[16]; - static Key zobSideToMove; - static Score PieceSquareTable[16][64]; - static Key zobExclusion; - static const Value seeValues[8]; - static const Value PieceValueMidgame[17]; - static const Value PieceValueEndgame[17]; + public: + static void init(); + + Position() = default; + Position(const Position&) = delete; + Position& operator=(const Position&) = delete; + + // FEN string input/output + Position& set(const std::string& fenStr, bool isChess960, StateInfo* si, Thread* th); + Position& set(const std::string& code, Color c, StateInfo* si); + std::string fen() const; + + // Position representation + Bitboard pieces(PieceType pt = ALL_PIECES) const; + template + Bitboard pieces(PieceType pt, PieceTypes... pts) const; + Bitboard pieces(Color c) const; + template + Bitboard pieces(Color c, PieceTypes... pts) const; + Piece piece_on(Square s) const; + Square ep_square() const; + bool empty(Square s) const; + template + int count(Color c) const; + template + int count() const; + template + Square square(Color c) const; + + // Castling + CastlingRights castling_rights(Color c) const; + bool can_castle(CastlingRights cr) const; + bool castling_impeded(CastlingRights cr) const; + Square castling_rook_square(CastlingRights cr) const; + + // Checking + Bitboard checkers() const; + Bitboard blockers_for_king(Color c) const; + Bitboard check_squares(PieceType pt) const; + Bitboard pinners(Color c) const; + + // Attacks to/from a given square + Bitboard attackers_to(Square s) const; + Bitboard attackers_to(Square s, Bitboard occupied) const; + void update_slider_blockers(Color c) const; + template + Bitboard attacks_by(Color c) const; + + // Properties of moves + bool legal(Move m) const; + bool pseudo_legal(const Move m) const; + bool capture(Move m) const; + bool capture_stage(Move m) const; + bool gives_check(Move m) const; + Piece moved_piece(Move m) const; + Piece captured_piece() const; + + // Doing and undoing moves + void do_move(Move m, StateInfo& newSt); + void do_move(Move m, StateInfo& newSt, bool givesCheck); + void undo_move(Move m); + void do_null_move(StateInfo& newSt); + void undo_null_move(); + + // Static Exchange Evaluation + bool see_ge(Move m, Value threshold = VALUE_ZERO) const; + + // Accessing hash keys + Key key() const; + Key key_after(Move m) const; + Key material_key() const; + Key pawn_key() const; + + // Other properties of the position + Color side_to_move() const; + int game_ply() const; + bool is_chess960() const; + Thread* this_thread() const; + bool is_draw(int ply) const; + bool has_game_cycle(int ply) const; + bool has_repeated() const; + int rule50_count() const; + Value non_pawn_material(Color c) const; + Value non_pawn_material() const; + + // Position consistency check, for debugging + bool pos_is_ok() const; + void flip(); + + // Used by NNUE + StateInfo* state() const; + + void put_piece(Piece pc, Square s); + void remove_piece(Square s); + + private: + // Initialization helpers (used while setting up a position) + void set_castling_right(Color c, Square rfrom); + void set_state() const; + void set_check_info() const; + + // Other helpers + void move_piece(Square from, Square to); + template + void do_castling(Color us, Square from, Square& to, Square& rfrom, Square& rto); + template + Key adjust_key50(Key k) const; + + // Data members + Piece board[SQUARE_NB]; + Bitboard byTypeBB[PIECE_TYPE_NB]; + Bitboard byColorBB[COLOR_NB]; + int pieceCount[PIECE_NB]; + int castlingRightsMask[SQUARE_NB]; + Square castlingRookSquare[CASTLING_RIGHT_NB]; + Bitboard castlingPath[CASTLING_RIGHT_NB]; + Thread* thisThread; + StateInfo* st; + int gamePly; + Color sideToMove; + bool chess960; }; -inline int64_t Position::nodes_searched() const { - return nodes; -} +std::ostream& operator<<(std::ostream& os, const Position& pos); -inline void Position::set_nodes_searched(int64_t n) { - nodes = n; -} +inline Color Position::side_to_move() const { return sideToMove; } inline Piece Position::piece_on(Square s) const { - return board[s]; -} - -inline Color Position::color_of_piece_on(Square s) const { - return color_of_piece(piece_on(s)); -} - -inline PieceType Position::type_of_piece_on(Square s) const { - return type_of_piece(piece_on(s)); -} - -inline bool Position::square_is_empty(Square s) const { - return piece_on(s) == PIECE_NONE; -} - -inline bool Position::square_is_occupied(Square s) const { - return !square_is_empty(s); -} - -inline Value Position::midgame_value_of_piece_on(Square s) const { - return PieceValueMidgame[piece_on(s)]; -} - -inline Value Position::endgame_value_of_piece_on(Square s) const { - return PieceValueEndgame[piece_on(s)]; -} - -inline Color Position::side_to_move() const { - return sideToMove; -} - -inline Bitboard Position::occupied_squares() const { - return byTypeBB[0]; + assert(is_ok(s)); + return board[s]; } -inline Bitboard Position::empty_squares() const { - return ~occupied_squares(); -} +inline bool Position::empty(Square s) const { return piece_on(s) == NO_PIECE; } -inline Bitboard Position::pieces_of_color(Color c) const { - return byColorBB[c]; -} +inline Piece Position::moved_piece(Move m) const { return piece_on(from_sq(m)); } -inline Bitboard Position::pieces(PieceType pt) const { - return byTypeBB[pt]; -} +inline Bitboard Position::pieces(PieceType pt) const { return byTypeBB[pt]; } -inline Bitboard Position::pieces(PieceType pt, Color c) const { - return byTypeBB[pt] & byColorBB[c]; +template +inline Bitboard Position::pieces(PieceType pt, PieceTypes... pts) const { + return pieces(pt) | pieces(pts...); } -inline Bitboard Position::pieces(PieceType pt1, PieceType pt2) const { - return byTypeBB[pt1] | byTypeBB[pt2]; -} +inline Bitboard Position::pieces(Color c) const { return byColorBB[c]; } -inline Bitboard Position::pieces(PieceType pt1, PieceType pt2, Color c) const { - return (byTypeBB[pt1] | byTypeBB[pt2]) & byColorBB[c]; +template +inline Bitboard Position::pieces(Color c, PieceTypes... pts) const { + return pieces(c) & pieces(pts...); } -inline int Position::piece_count(Color c, PieceType pt) const { - return pieceCount[c][pt]; +template +inline int Position::count(Color c) const { + return pieceCount[make_piece(c, Pt)]; } -inline Square Position::piece_list(Color c, PieceType pt, int idx) const { - return pieceList[c][pt][idx]; +template +inline int Position::count() const { + return count(WHITE) + count(BLACK); } -inline const Square* Position::piece_list_begin(Color c, PieceType pt) const { - return pieceList[c][pt]; +template +inline Square Position::square(Color c) const { + assert(count(c) == 1); + return lsb(pieces(c, Pt)); } -inline Square Position::ep_square() const { - return st->epSquare; -} +inline Square Position::ep_square() const { return st->epSquare; } -inline Square Position::king_square(Color c) const { - return pieceList[c][KING][0]; -} +inline bool Position::can_castle(CastlingRights cr) const { return st->castlingRights & cr; } -inline bool Position::can_castle_kingside(Color c) const { - return st->castleRights & (WHITE_OO << c); +inline CastlingRights Position::castling_rights(Color c) const { + return c & CastlingRights(st->castlingRights); } -inline bool Position::can_castle_queenside(Color c) const { - return st->castleRights & (WHITE_OOO << c); -} +inline bool Position::castling_impeded(CastlingRights cr) const { + assert(cr == WHITE_OO || cr == WHITE_OOO || cr == BLACK_OO || cr == BLACK_OOO); -inline bool Position::can_castle(Color c) const { - return st->castleRights & ((WHITE_OO | WHITE_OOO) << c); + return pieces() & castlingPath[cr]; } -inline void Position::set_castle_kingside(Color c) { - st->castleRights |= (WHITE_OO << c); -} +inline Square Position::castling_rook_square(CastlingRights cr) const { + assert(cr == WHITE_OO || cr == WHITE_OOO || cr == BLACK_OO || cr == BLACK_OOO); -inline void Position::set_castle_queenside(Color c) { - st->castleRights |= (WHITE_OOO << c); + return castlingRookSquare[cr]; } -inline Square Position::initial_kr_square(Color c) const { - return relative_square(c, make_square(initialKRFile, RANK_1)); -} +inline Bitboard Position::attackers_to(Square s) const { return attackers_to(s, pieces()); } -inline Square Position::initial_qr_square(Color c) const { - return relative_square(c, make_square(initialQRFile, RANK_1)); -} +template +inline Bitboard Position::attacks_by(Color c) const { -template<> -inline Bitboard Position::attacks_from(Square s, Color c) const { - return StepAttacksBB[make_piece(c, PAWN)][s]; + if constexpr (Pt == PAWN) + return c == WHITE ? pawn_attacks_bb(pieces(WHITE, PAWN)) + : pawn_attacks_bb(pieces(BLACK, PAWN)); + else + { + Bitboard threats = 0; + Bitboard attackers = pieces(c, Pt); + while (attackers) + threats |= attacks_bb(pop_lsb(attackers), pieces()); + return threats; + } } -template // Knight and King and white pawns -inline Bitboard Position::attacks_from(Square s) const { - return StepAttacksBB[Piece][s]; -} +inline Bitboard Position::checkers() const { return st->checkersBB; } -template<> -inline Bitboard Position::attacks_from(Square s) const { - return bishop_attacks_bb(s, occupied_squares()); -} +inline Bitboard Position::blockers_for_king(Color c) const { return st->blockersForKing[c]; } -template<> -inline Bitboard Position::attacks_from(Square s) const { - return rook_attacks_bb(s, occupied_squares()); -} - -template<> -inline Bitboard Position::attacks_from(Square s) const { - return attacks_from(s) | attacks_from(s); -} +inline Bitboard Position::pinners(Color c) const { return st->pinners[c]; } -inline Bitboard Position::checkers() const { - return st->checkersBB; -} +inline Bitboard Position::check_squares(PieceType pt) const { return st->checkSquares[pt]; } -inline bool Position::in_check() const { - return st->checkersBB != EmptyBoardBB; -} +inline Key Position::key() const { return adjust_key50(st->key); } -inline bool Position::pawn_is_passed(Color c, Square s) const { - return !(pieces(PAWN, opposite_color(c)) & passed_pawn_mask(c, s)); +template +inline Key Position::adjust_key50(Key k) const { + return st->rule50 < 14 - AfterMove ? k : k ^ make_key((st->rule50 - (14 - AfterMove)) / 8); } -inline bool Position::square_is_weak(Square s, Color c) const { - return !(pieces(PAWN, opposite_color(c)) & attack_span_mask(c, s)); -} +inline Key Position::pawn_key() const { return st->pawnKey; } -inline int Position::see_value(PieceType pt) { - return seeValues[pt]; -} +inline Key Position::material_key() const { return st->materialKey; } -inline Key Position::get_key() const { - return st->key; -} +inline Value Position::non_pawn_material(Color c) const { return st->nonPawnMaterial[c]; } -inline Key Position::get_exclusion_key() const { - return st->key ^ zobExclusion; +inline Value Position::non_pawn_material() const { + return non_pawn_material(WHITE) + non_pawn_material(BLACK); } -inline Key Position::get_pawn_key() const { - return st->pawnKey; -} +inline int Position::game_ply() const { return gamePly; } -inline Key Position::get_material_key() const { - return st->materialKey; -} +inline int Position::rule50_count() const { return st->rule50; } -inline Score Position::pst(Color c, PieceType pt, Square s) { - return PieceSquareTable[make_piece(c, pt)][s]; -} +inline bool Position::is_chess960() const { return chess960; } -inline Score Position::pst_delta(Piece piece, Square from, Square to) { - return PieceSquareTable[piece][to] - PieceSquareTable[piece][from]; +inline bool Position::capture(Move m) const { + assert(is_ok(m)); + return (!empty(to_sq(m)) && type_of(m) != CASTLING) || type_of(m) == EN_PASSANT; } -inline Score Position::value() const { - return st->value; +// Returns true if a move is generated from the capture stage, having also +// queen promotions covered, i.e. consistency with the capture stage move generation +// is needed to avoid the generation of duplicate moves. +inline bool Position::capture_stage(Move m) const { + assert(is_ok(m)); + return capture(m) || promotion_type(m) == QUEEN; } -inline Value Position::non_pawn_material(Color c) const { - return st->npMaterial[c]; -} +inline Piece Position::captured_piece() const { return st->capturedPiece; } -inline bool Position::move_is_passed_pawn_push(Move m) const { +inline Thread* Position::this_thread() const { return thisThread; } - Color c = side_to_move(); - return piece_on(move_from(m)) == make_piece(c, PAWN) - && pawn_is_passed(c, move_to(m)); -} +inline void Position::put_piece(Piece pc, Square s) { -inline int Position::startpos_ply_counter() const { - return startPosPlyCounter; + board[s] = pc; + byTypeBB[ALL_PIECES] |= byTypeBB[type_of(pc)] |= s; + byColorBB[color_of(pc)] |= s; + pieceCount[pc]++; + pieceCount[make_piece(color_of(pc), ALL_PIECES)]++; } -inline bool Position::opposite_colored_bishops() const { +inline void Position::remove_piece(Square s) { - return piece_count(WHITE, BISHOP) == 1 && piece_count(BLACK, BISHOP) == 1 - && opposite_color_squares(piece_list(WHITE, BISHOP, 0), piece_list(BLACK, BISHOP, 0)); + Piece pc = board[s]; + byTypeBB[ALL_PIECES] ^= s; + byTypeBB[type_of(pc)] ^= s; + byColorBB[color_of(pc)] ^= s; + board[s] = NO_PIECE; + pieceCount[pc]--; + pieceCount[make_piece(color_of(pc), ALL_PIECES)]--; } -inline bool Position::has_pawn_on_7th(Color c) const { - return pieces(PAWN, c) & rank_bb(relative_rank(c, RANK_7)); -} +inline void Position::move_piece(Square from, Square to) { -inline bool Position::is_chess960() const { - return chess960; + Piece pc = board[from]; + Bitboard fromTo = from | to; + byTypeBB[ALL_PIECES] ^= fromTo; + byTypeBB[type_of(pc)] ^= fromTo; + byColorBB[color_of(pc)] ^= fromTo; + board[from] = NO_PIECE; + board[to] = pc; } -inline bool Position::move_is_capture(Move m) const { +inline void Position::do_move(Move m, StateInfo& newSt) { do_move(m, newSt, gives_check(m)); } - assert (m != MOVE_NONE && m != MOVE_NULL); - return !move_is_special(m) ? !square_is_empty(move_to(m)) : move_is_ep(m); -} +inline StateInfo* Position::state() const { return st; } -inline PieceType Position::captured_piece_type() const { - return st->capturedType; -} - -inline int Position::thread() const { - return threadID; -} +} // namespace Stockfish -#endif // !defined(POSITION_H_INCLUDED) +#endif // #ifndef POSITION_H_INCLUDED