X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fposition.h;h=4305759b0cf751c7cfa0f1eaaea3d90fffade9fa;hp=1505874e9f0269111f338fd5d09f0a2efca95b7b;hb=e304db9d1ecf6a2318708483c90fadecf4fac4ee;hpb=049139d025b26a9fbc9cf87f51b578a4fab447cf diff --git a/src/position.h b/src/position.h index 1505874e..fced8e0c 100644 --- a/src/position.h +++ b/src/position.h @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2009 Marco Costalba + Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad 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,67 +17,28 @@ along with this program. If not, see . */ - #if !defined(POSITION_H_INCLUDED) #define POSITION_H_INCLUDED -// Disable some silly and noisy warning from MSVC compiler -#if defined(_MSC_VER) - -// Forcing value to bool 'true' or 'false' (performance warning) -#pragma warning(disable: 4800) - -// Conditional expression is constant -#pragma warning(disable: 4127) - - -#endif - -//// -//// Includes -//// +#include #include "bitboard.h" -#include "color.h" -#include "direction.h" -#include "move.h" -#include "piece.h" -#include "square.h" -#include "value.h" - +#include "types.h" -//// -//// Constants -//// -/// FEN string for the initial position -const std::string StartPosition = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1"; +/// The checkInfo struct is initialized at c'tor time and keeps info used +/// to detect if a move gives check. +class Position; +class Thread; -/// 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; +struct CheckInfo { + explicit CheckInfo(const Position&); -//// -//// Types -//// - -/// Castle rights, encoded as bit fields - -enum CastleRights { - NO_CASTLES = 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 + Bitboard dcCandidates; + Bitboard pinned; + Bitboard checkSq[PIECE_TYPE_NB]; + Square ksq; }; @@ -87,17 +48,26 @@ enum Phase { /// must be passed as a parameter. struct StateInfo { - Key key, pawnKey, materialKey; - int castleRights, rule50; - Square kingSquare[2], epSquare; - Value mgValue, egValue; - Value npMaterial[2]; + Key pawnKey, materialKey; + Value npMaterial[COLOR_NB]; + int castleRights, rule50, pliesFromNull; + Score psqScore; + Square epSquare; - PieceType capture; + Key key; Bitboard checkersBB; + PieceType capturedType; StateInfo* previous; }; +struct ReducedStateInfo { + Key pawnKey, materialKey; + Value npMaterial[COLOR_NB]; + int castleRights, rule50, pliesFromNull; + Score psqScore; + Square epSquare; +}; + /// The position data structure. A position consists of the following data: /// @@ -122,177 +92,112 @@ struct StateInfo { /// * A counter for detecting 50 move rule draws. class Position { - - friend class MaterialInfo; - friend class EndgameFunctions; - public: - enum GamePhase { - MidGame, - EndGame - }; - - // Constructors Position() {} - Position(const Position& pos); - Position(const std::string& fen); + 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& operator=(const Position&); // Text input/output - void from_fen(const std::string& fen); + void from_fen(const std::string& fen, bool isChess960, Thread* th); const std::string to_fen() const; void print(Move m = MOVE_NONE) const; - // Copying - void copy(const Position& pos); - void flipped_copy(const Position& pos); - - // 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; + // Position representation + Bitboard pieces() 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 + Bitboard pieces(Color c) const; + Bitboard pieces(Color c, PieceType pt) const; + Bitboard pieces(Color c, PieceType pt1, PieceType pt2) const; + Piece piece_on(Square s) const; Square king_square(Color c) const; + Square ep_square() const; + bool is_empty(Square s) const; + const Square* piece_list(Color c, PieceType pt) const; + int piece_count(Color c, PieceType pt) 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, Bitboard& p) const; - Bitboard pinned_pieces(Color c) const; + // Castling + int can_castle(CastleRight f) const; + int can_castle(Color c) const; + bool castle_impeded(Color c, CastlingSide s) const; + Square castle_rook_square(Color c, CastlingSide s) const; - // Checking pieces and under check information + // Checking + bool in_check() const; Bitboard checkers() const; - bool is_check() const; - - // Piece lists - Square piece_list(Color c, PieceType pt, int index) const; + Bitboard discovered_check_candidates() const; + Bitboard pinned_pieces() const; - // Attack information to a given square - Bitboard attacks_to(Square s) const; - Bitboard attacks_to(Square s, Color c) const; - template Bitboard piece_attacks(Square s) const; - Bitboard pawn_attacks(Square s, Color c) const; - - // Attack information to a given square from another given square - template Bitboard piece_attacks_square(Square f, Square t) const; // Dispatch at compile-time - bool piece_attacks_square(Piece p, Square f, Square t) const; // Dispatch at run-time - bool pawn_attacks_square(Square f, Square t, Color c) const; + // Attacks to/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) 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_passed_pawn_push(Move m) const; + bool move_gives_check(Move m, const CheckInfo& ci) const; bool move_attacks_square(Move m, Square s) const; - - // Information about pawns + 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; + bool is_capture_or_promotion(Move m) const; + bool is_passed_pawn_push(Move m) const; + Piece piece_moved(Move m) const; + PieceType captured_piece_type() const; + + // Piece specific bool pawn_is_passed(Color c, Square s) const; - static bool pawn_is_passed(Bitboard theirPawns, Color c, Square s); - static bool pawn_is_isolated(Bitboard ourPawns, Square s); - static bool pawn_is_doubled(Bitboard ourPawns, Color c, Square s); - - // Weak squares - bool square_is_weak(Square s, Color c) const; + bool pawn_on_7th(Color c) const; + bool opposite_bishops() const; + bool bishop_pair(Color c) const; // Doing and undoing moves - void saveState(); void do_move(Move m, StateInfo& st); - void do_move(Move m, StateInfo& st, Bitboard dcCandidates); + 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(); + template void do_null_move(StateInfo& st); // Static exchange evaluation - int see(Square from, Square to) const; int see(Move m) const; - int see(Square to) const; int see_sign(Move m) const; // Accessing hash keys - Key get_key() const; - Key get_pawn_key() const; - Key get_material_key() const; - - // Incremental evaluation - Value mg_value() const; - Value eg_value() const; + Key key() const; + Key exclusion_key() const; + Key pawn_key() const; + Key material_key() const; + + // Incremental piece-square evaluation + Score psq_score() const; + Score psq_delta(Piece p, Square from, Square to) const; Value non_pawn_material(Color c) const; - Phase game_phase() const; - template Value pst_delta(Piece piece, Square from, Square to) const; - - // Game termination checks - bool is_mate() const; - bool is_draw() const; - - // Check if one side threatens a mate in one - bool has_mate_threat(Color c); - - // Number of plies since the last non-reversible move - int rule_50_counter() const; // Other properties of the position - bool opposite_colored_bishops() const; - bool has_pawn_on_7th(Color c) const; - - // Reset the gamePly variable to 0 - void reset_game_ply(); + Color side_to_move() const; + int startpos_ply_counter() const; + bool is_chess960() const; + Thread* this_thread() const; + int64_t nodes_searched() const; + void set_nodes_searched(int64_t n); + template bool is_draw() const; // Position consistency check, for debugging - bool is_ok(int* failedStep = NULL) const; - - // Static member functions - static void init_zobrist(); - static void init_piece_square_tables(); + bool pos_is_ok(int* failedStep = NULL) const; + void flip(); private: - - // Initialization helper functions (used while setting up a position) + // Initialization helpers (used while setting up a position) void clear(); void put_piece(Piece p, Square s); - void allow_oo(Color c); - void allow_ooo(Color c); - - // Helper functions for doing and undoing moves - void do_capture_move(Bitboard& 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 - void update_checkers(Bitboard* pCheckersBB, Square ksq, Square from, Square to, Bitboard dcCandidates); + void set_castle_right(Color c, Square rfrom); - template - Bitboard hidden_checkers(Color c) const; + // Helper template functions + template void do_castle_move(Move m); + template Bitboard hidden_checkers() const; // Computing hash keys from scratch (for initialization and debugging) Key compute_key() const; @@ -300,113 +205,84 @@ private: Key compute_material_key() const; // Computing incremental evaluation scores and material counts - template Value pst(Color c, PieceType pt, Square s) const; - template Value compute_value() const; + Score compute_psq_score() const; Value compute_non_pawn_material(Color c) const; - // Bitboards - Bitboard byColorBB[2], byTypeBB[8]; - - // Board - Piece board[64]; - - // Piece counts - int pieceCount[2][8]; // [color][pieceType] - - // Piece lists - Square pieceList[2][8][16]; // [color][pieceType][index] - int index[64]; // [square] + // Board and pieces + Piece board[SQUARE_NB]; + Bitboard byTypeBB[PIECE_TYPE_NB]; + Bitboard byColorBB[COLOR_NB]; + int pieceCount[COLOR_NB][PIECE_TYPE_NB]; + Square pieceList[COLOR_NB][PIECE_TYPE_NB][16]; + int index[SQUARE_NB]; // Other info - Color sideToMove; - int gamePly; - Key history[MaxGameLength]; - File initialKFile, initialKRFile, initialQRFile; + int castleRightsMask[SQUARE_NB]; + Square castleRookSquare[COLOR_NB][CASTLING_SIDE_NB]; + Bitboard castlePath[COLOR_NB][CASTLING_SIDE_NB]; StateInfo startState; + int64_t nodes; + int startPosPly; + Color sideToMove; + Thread* thisThread; StateInfo* st; - - // Static variables - static int castleRightsMask[64]; - static Key zobrist[2][8][64]; - static Key zobEp[64]; - static Key zobCastle[16]; - static Key zobMaterial[2][8][16]; - static Key zobSideToMove; - static Value MgPieceSquareTable[16][64]; - static Value EgPieceSquareTable[16][64]; + int chess960; }; - -//// -//// Inline functions -//// - -inline Piece Position::piece_on(Square s) const { - return board[s]; +inline int64_t Position::nodes_searched() const { + return nodes; } -inline Color Position::color_of_piece_on(Square s) const { - return color_of_piece(piece_on(s)); +inline void Position::set_nodes_searched(int64_t n) { + nodes = n; } -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) == EMPTY; -} - -inline bool Position::square_is_occupied(Square s) const { - return !square_is_empty(s); +inline Piece Position::piece_on(Square s) const { + return board[s]; } -inline Value Position::midgame_value_of_piece_on(Square s) const { - return piece_value_midgame(piece_on(s)); +inline Piece Position::piece_moved(Move m) const { + return board[from_sq(m)]; } -inline Value Position::endgame_value_of_piece_on(Square s) const { - return piece_value_endgame(piece_on(s)); +inline bool Position::is_empty(Square s) const { + return board[s] == NO_PIECE; } inline Color Position::side_to_move() const { return sideToMove; } -inline Bitboard Position::occupied_squares() const { - return byTypeBB[0]; -} - -inline Bitboard Position::empty_squares() const { - return ~(occupied_squares()); -} - -inline Bitboard Position::pieces_of_color(Color c) const { - return byColorBB[c]; +inline Bitboard Position::pieces() const { + return byTypeBB[ALL_PIECES]; } inline Bitboard Position::pieces(PieceType pt) const { return byTypeBB[pt]; } -inline Bitboard Position::pieces(PieceType pt, Color c) const { - return byTypeBB[pt] & byColorBB[c]; -} - inline Bitboard Position::pieces(PieceType pt1, PieceType pt2) const { return byTypeBB[pt1] | byTypeBB[pt2]; } -inline Bitboard Position::pieces(PieceType pt1, PieceType pt2, Color c) const { - return (byTypeBB[pt1] | byTypeBB[pt2]) & byColorBB[c]; +inline Bitboard Position::pieces(Color c) const { + return byColorBB[c]; +} + +inline Bitboard Position::pieces(Color c, PieceType pt) const { + return byColorBB[c] & byTypeBB[pt]; +} + +inline Bitboard Position::pieces(Color c, PieceType pt1, PieceType pt2) const { + return byColorBB[c] & (byTypeBB[pt1] | byTypeBB[pt2]); } inline int Position::piece_count(Color c, PieceType pt) const { return pieceCount[c][pt]; } -inline Square Position::piece_list(Color c, PieceType pt, int index) const { - return pieceList[c][pt][index]; +inline const Square* Position::piece_list(Color c, PieceType pt) const { + return pieceList[c][pt]; } inline Square Position::ep_square() const { @@ -414,181 +290,144 @@ inline Square Position::ep_square() const { } inline Square Position::king_square(Color c) const { - return st->kingSquare[c]; -} - -inline bool Position::can_castle_kingside(Color side) const { - return st->castleRights & (1+int(side)); + return pieceList[c][KING][0]; } -inline bool Position::can_castle_queenside(Color side) const { - return st->castleRights & (4+4*int(side)); +inline int Position::can_castle(CastleRight f) const { + return st->castleRights & f; } -inline bool Position::can_castle(Color side) const { - return can_castle_kingside(side) || can_castle_queenside(side); +inline int Position::can_castle(Color c) const { + return st->castleRights & ((WHITE_OO | WHITE_OOO) << (2 * c)); } -inline Square Position::initial_kr_square(Color c) const { - return relative_square(c, make_square(initialKRFile, RANK_1)); +inline bool Position::castle_impeded(Color c, CastlingSide s) const { + return byTypeBB[ALL_PIECES] & castlePath[c][s]; } -inline Square Position::initial_qr_square(Color c) const { - return relative_square(c, make_square(initialQRFile, RANK_1)); +inline Square Position::castle_rook_square(Color c, CastlingSide s) const { + return castleRookSquare[c][s]; } -inline Bitboard Position::pawn_attacks(Square s, Color c) const { - return StepAttackBB[piece_of_color_and_type(c, PAWN)][s]; -} +template +inline Bitboard Position::attacks_from(Square s) const { -template // Knight and King -inline Bitboard Position::piece_attacks(Square s) const { - return StepAttackBB[Piece][s]; + return Pt == BISHOP || Pt == ROOK ? attacks_bb(s, pieces()) + : Pt == QUEEN ? attacks_from(s) | attacks_from(s) + : StepAttacksBB[Pt][s]; } template<> -inline Bitboard Position::piece_attacks(Square s) const { - return StepAttackBB[WP][s] | StepAttackBB[BP][s]; +inline Bitboard Position::attacks_from(Square s, Color c) const { + return StepAttacksBB[make_piece(c, PAWN)][s]; } -template<> -inline Bitboard Position::piece_attacks(Square s) const { - return bishop_attacks_bb(s, occupied_squares()); +inline Bitboard Position::attacks_from(Piece p, Square s) const { + return attacks_from(p, s, byTypeBB[ALL_PIECES]); } -template<> -inline Bitboard Position::piece_attacks(Square s) const { - return rook_attacks_bb(s, occupied_squares()); -} - -template<> -inline Bitboard Position::piece_attacks(Square s) const { - return piece_attacks(s) | piece_attacks(s); +inline Bitboard Position::attackers_to(Square s) const { + return attackers_to(s, byTypeBB[ALL_PIECES]); } inline Bitboard Position::checkers() const { return st->checkersBB; } -inline bool Position::is_check() const { - return st->checkersBB != EmptyBoardBB; +inline bool Position::in_check() const { + return st->checkersBB != 0; } -inline bool Position::pawn_attacks_square(Square f, Square t, Color c) const { - return bit_is_set(pawn_attacks(f, c), t); +inline Bitboard Position::discovered_check_candidates() const { + return hidden_checkers(); } -template -inline 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 Bitboard Position::pinned_pieces() const { + return hidden_checkers(); } inline bool Position::pawn_is_passed(Color c, Square s) const { - return !(pieces(PAWN, opposite_color(c)) & passed_pawn_mask(c, s)); -} - -inline bool Position::pawn_is_passed(Bitboard theirPawns, Color c, Square s) { - return !(theirPawns & passed_pawn_mask(c, s)); -} - -inline bool Position::pawn_is_isolated(Bitboard ourPawns, Square s) { - return !(ourPawns & neighboring_files_bb(s)); -} - -inline bool Position::pawn_is_doubled(Bitboard ourPawns, Color c, Square s) { - return ourPawns & squares_behind(c, s); + return !(pieces(~c, PAWN) & passed_pawn_mask(c, s)); } -inline bool Position::square_is_weak(Square s, Color c) const { - return !(pieces(PAWN, c) & outpost_mask(opposite_color(c), s)); +inline Key Position::key() const { + return st->key; } -inline Key Position::get_key() const { - return st->key; +inline Key Position::exclusion_key() const { + return st->key ^ Zobrist::exclusion; } -inline Key Position::get_pawn_key() const { +inline Key Position::pawn_key() const { return st->pawnKey; } -inline Key Position::get_material_key() const { +inline Key Position::material_key() const { return st->materialKey; } -template -inline Value Position::pst(Color c, PieceType pt, Square s) const { - return (Ph == MidGame ? MgPieceSquareTable[piece_of_color_and_type(c, pt)][s] - : EgPieceSquareTable[piece_of_color_and_type(c, pt)][s]); -} - -template -inline Value Position::pst_delta(Piece piece, Square from, Square to) const { - return (Ph == MidGame ? MgPieceSquareTable[piece][to] - MgPieceSquareTable[piece][from] - : EgPieceSquareTable[piece][to] - EgPieceSquareTable[piece][from]); -} - -inline Value Position::mg_value() const { - return st->mgValue; +inline Score Position::psq_delta(Piece p, Square from, Square to) const { + return pieceSquareTable[p][to] - pieceSquareTable[p][from]; } -inline Value Position::eg_value() const { - return st->egValue; +inline Score Position::psq_score() const { + return st->psqScore; } inline Value Position::non_pawn_material(Color c) const { return st->npMaterial[c]; } -inline Phase Position::game_phase() const { +inline bool Position::is_passed_pawn_push(Move m) const { - // Values modified by Joona Kiiski - static const Value MidgameLimit = Value(15581); - static const Value EndgameLimit = Value(3998); - - Value npm = non_pawn_material(WHITE) + non_pawn_material(BLACK); + return type_of(piece_moved(m)) == PAWN + && pawn_is_passed(sideToMove, to_sq(m)); +} - if (npm >= MidgameLimit) - return PHASE_MIDGAME; - else if(npm <= EndgameLimit) - return PHASE_ENDGAME; - else - return Phase(((npm - EndgameLimit) * 128) / (MidgameLimit - EndgameLimit)); +inline int Position::startpos_ply_counter() const { + return startPosPly + st->pliesFromNull; // HACK } -inline bool Position::move_is_passed_pawn_push(Move m) const { +inline bool Position::opposite_bishops() const { - Color c = side_to_move(); - return piece_on(move_from(m)) == piece_of_color_and_type(c, PAWN) - && pawn_is_passed(c, move_to(m)); + return pieceCount[WHITE][BISHOP] == 1 + && pieceCount[BLACK][BISHOP] == 1 + && opposite_colors(pieceList[WHITE][BISHOP][0], pieceList[BLACK][BISHOP][0]); } -inline int Position::rule_50_counter() const { +inline bool Position::bishop_pair(Color c) const { - return st->rule50; + return pieceCount[c][BISHOP] >= 2 + && opposite_colors(pieceList[c][BISHOP][0], pieceList[c][BISHOP][1]); } -inline bool Position::opposite_colored_bishops() const { +inline bool Position::pawn_on_7th(Color c) const { + return pieces(c, PAWN) & rank_bb(relative_rank(c, RANK_7)); +} - return piece_count(WHITE, BISHOP) == 1 - && piece_count(BLACK, BISHOP) == 1 - && square_color(piece_list(WHITE, BISHOP, 0)) != square_color(piece_list(BLACK, BISHOP, 0)); +inline bool Position::is_chess960() const { + return chess960; } -inline bool Position::has_pawn_on_7th(Color c) const { +inline bool Position::is_capture_or_promotion(Move m) const { - return pieces(PAWN, c) & relative_rank_bb(c, RANK_7); + assert(is_ok(m)); + return type_of(m) ? type_of(m) != CASTLE : !is_empty(to_sq(m)); } -inline bool Position::move_is_capture(Move m) const { +inline bool Position::is_capture(Move m) const { - // Move must not be MOVE_NONE ! + // Note that castle is coded as "king captures the rook" + assert(is_ok(m)); + return (!is_empty(to_sq(m)) && type_of(m) != CASTLE) || type_of(m) == ENPASSANT; +} + +inline PieceType Position::captured_piece_type() const { + return st->capturedType; +} - return (!square_is_empty(move_to(m)) && !move_is_castle(m)) || move_is_ep(m); +inline Thread* Position::this_thread() const { + return thisThread; } #endif // !defined(POSITION_H_INCLUDED)