X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fposition.h;h=7dcbb6f479ab91302e964e50de4c64cae5936e65;hp=91604e94a81d12f1068c3db6b7a62e54f30fd8f3;hb=ad0fdf0da6d9fdc38a5ceb96eeed0d79c8e38dc9;hpb=95212222c7444538b84326208e433ac12f15e9fb diff --git a/src/position.h b/src/position.h index 91604e94..7dcbb6f4 100644 --- a/src/position.h +++ b/src/position.h @@ -20,11 +20,11 @@ #if !defined(POSITION_H_INCLUDED) #define POSITION_H_INCLUDED +#include + #include "bitboard.h" #include "move.h" -#include "piece.h" -#include "square.h" -#include "value.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 @@ -106,9 +106,6 @@ struct StateInfo { class Position { - friend class MaterialInfo; - friend class EndgameFunctions; - Position(); // No default or copy c'tor allowed Position(const Position& pos); @@ -128,7 +125,7 @@ public: void print(Move m = MOVE_NONE) const; // Copying - void flipped_copy(const Position& pos); + void flip(); // The piece on a given square Piece piece_on(Square s) const; @@ -173,7 +170,7 @@ public: // Checking pieces and under check information Bitboard checkers() const; - bool is_check() const; + bool in_check() const; // Piece lists Square piece_list(Color c, PieceType pt, int index) const; @@ -189,8 +186,10 @@ public: // Properties of moves bool pl_move_is_legal(Move m, Bitboard pinned) const; bool pl_move_is_evasion(Move m, Bitboard pinned) const; - bool move_is_check(Move m) const; - bool move_is_check(Move m, const CheckInfo& ci) const; + bool move_is_legal(const Move m) const; + bool move_is_legal(const Move m, Bitboard pinned) const; + bool move_gives_check(Move m) const; + bool move_gives_check(Move m, const CheckInfo& ci) const; bool move_is_capture(Move m) const; bool move_is_capture_or_promotion(Move m) const; bool move_is_passed_pawn_push(Move m) const; @@ -214,7 +213,6 @@ public: void undo_null_move(); // Static exchange evaluation - int see(Square from, Square to) const; int see(Move m) const; int see_sign(Move m) const; @@ -233,9 +231,6 @@ public: bool is_mate() const; bool is_draw() const; - // Check if side to move could be mated in one - bool has_mate_threat(); - // Number of plies from starting position int startpos_ply_counter() const; @@ -305,7 +300,7 @@ private: int castleRightsMask[64]; StateInfo startState; File initialKFile, initialKRFile, initialQRFile; - bool isChess960; + bool chess960; int startPosPlyCounter; int threadID; int64_t nodes; @@ -433,12 +428,12 @@ inline Square Position::initial_qr_square(Color c) const { template<> inline Bitboard Position::attacks_from(Square s, Color c) const { - return NonSlidingAttacksBB[make_piece(c, PAWN)][s]; + return StepAttacksBB[make_piece(c, PAWN)][s]; } template // Knight and King and white pawns inline Bitboard Position::attacks_from(Square s) const { - return NonSlidingAttacksBB[Piece][s]; + return StepAttacksBB[Piece][s]; } template<> @@ -460,7 +455,7 @@ inline Bitboard Position::checkers() const { return st->checkersBB; } -inline bool Position::is_check() const { +inline bool Position::in_check() const { return st->checkersBB != EmptyBoardBB; } @@ -526,18 +521,18 @@ inline bool Position::has_pawn_on_7th(Color c) const { } inline bool Position::is_chess960() const { - return isChess960; + return chess960; } inline bool Position::move_is_capture(Move m) const { - // Move must not be MOVE_NONE ! + assert (m != MOVE_NONE && m != MOVE_NULL); return (m & (3 << 15)) ? !move_is_castle(m) : !square_is_empty(move_to(m)); } inline bool Position::move_is_capture_or_promotion(Move m) const { - // Move must not be MOVE_NONE ! + assert (m != MOVE_NONE && m != MOVE_NULL); return (m & (0x1F << 12)) ? !move_is_castle(m) : !square_is_empty(move_to(m)); }