X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Ftypes.h;h=b73eccbac09c89a015de01cfe2afcb873be51152;hp=345751455dbf54d853a88dd874eea367ecd58e35;hb=24417a6cd9577e8574eadc26765e366888cc9b1e;hpb=89ec224cb92f49a6edc3d8b03a43d1c4418c285a diff --git a/src/types.h b/src/types.h index 34575145..b73eccba 100644 --- a/src/types.h +++ b/src/types.h @@ -46,9 +46,6 @@ typedef unsigned __int64 uint64_t; #endif -#define Min(x, y) (((x) < (y)) ? (x) : (y)) -#define Max(x, y) (((x) < (y)) ? (y) : (x)) - //// //// Configuration //// @@ -158,9 +155,53 @@ const bool CpuIs64Bit = false; typedef uint64_t Key; typedef uint64_t Bitboard; +const int MAX_MOVES = 256; const int PLY_MAX = 100; const int PLY_MAX_PLUS_2 = PLY_MAX + 2; +const Bitboard FileABB = 0x0101010101010101ULL; +const Bitboard FileBBB = FileABB << 1; +const Bitboard FileCBB = FileABB << 2; +const Bitboard FileDBB = FileABB << 3; +const Bitboard FileEBB = FileABB << 4; +const Bitboard FileFBB = FileABB << 5; +const Bitboard FileGBB = FileABB << 6; +const Bitboard FileHBB = FileABB << 7; + +const Bitboard Rank1BB = 0xFF; +const Bitboard Rank2BB = Rank1BB << (8 * 1); +const Bitboard Rank3BB = Rank1BB << (8 * 2); +const Bitboard Rank4BB = Rank1BB << (8 * 3); +const Bitboard Rank5BB = Rank1BB << (8 * 4); +const Bitboard Rank6BB = Rank1BB << (8 * 5); +const Bitboard Rank7BB = Rank1BB << (8 * 6); +const Bitboard Rank8BB = Rank1BB << (8 * 7); + +/// A move needs 16 bits to be stored +/// +/// bit 0- 5: destination square (from 0 to 63) +/// bit 6-11: origin square (from 0 to 63) +/// bit 12-13: promotion piece type - 2 (from KNIGHT-2 to QUEEN-2) +/// bit 14-15: special move flag: promotion (1), en passant (2), castle (3) +/// +/// Special cases are MOVE_NONE and MOVE_NULL. We can sneak these in because in +/// any normal move destination square is always different from origin square +/// while MOVE_NONE and MOVE_NULL have the same origin and destination square. + +enum Move { + MOVE_NONE = 0, + MOVE_NULL = 65 +}; + +struct MoveStack { + Move move; + int score; +}; + +inline bool operator<(const MoveStack& f, const MoveStack& s) { + return f.score < s.score; +} + enum ValueType { VALUE_TYPE_NONE = 0, VALUE_TYPE_UPPER = 1, @@ -184,26 +225,28 @@ enum Value { }; enum PieceType { - PIECE_TYPE_NONE = 0, + NO_PIECE_TYPE = 0, PAWN = 1, KNIGHT = 2, BISHOP = 3, ROOK = 4, QUEEN = 5, KING = 6 }; enum Piece { - PIECE_NONE_DARK_SQ = 0, WP = 1, WN = 2, WB = 3, WR = 4, WQ = 5, WK = 6, - BP = 9, BN = 10, BB = 11, BR = 12, BQ = 13, BK = 14, PIECE_NONE = 16 + NO_PIECE = 16, // color_of(NO_PIECE) == NO_COLOR + W_PAWN = 1, W_KNIGHT = 2, W_BISHOP = 3, W_ROOK = 4, W_QUEEN = 5, W_KING = 6, + B_PAWN = 9, B_KNIGHT = 10, B_BISHOP = 11, B_ROOK = 12, B_QUEEN = 13, B_KING = 14 }; enum Color { - WHITE, BLACK, COLOR_NONE + WHITE, BLACK, NO_COLOR }; enum Depth { ONE_PLY = 2, - DEPTH_ZERO = 0 * ONE_PLY, - DEPTH_QS_CHECKS = -1 * ONE_PLY, - DEPTH_QS_NO_CHECKS = -2 * ONE_PLY, + DEPTH_ZERO = 0 * ONE_PLY, + DEPTH_QS_CHECKS = -1 * ONE_PLY, + DEPTH_QS_NO_CHECKS = -2 * ONE_PLY, + DEPTH_QS_RECAPTURES = -4 * ONE_PLY, DEPTH_NONE = -127 * ONE_PLY }; @@ -240,17 +283,22 @@ enum Rank { RANK_1, RANK_2, RANK_3, RANK_4, RANK_5, RANK_6, RANK_7, RANK_8 }; -enum SquareColor { - DARK, LIGHT -}; - enum ScaleFactor { - SCALE_FACTOR_ZERO = 0, + SCALE_FACTOR_DRAW = 0, SCALE_FACTOR_NORMAL = 64, SCALE_FACTOR_MAX = 128, SCALE_FACTOR_NONE = 255 }; +enum CastleRight { + CASTLES_NONE = 0, + WHITE_OO = 1, + BLACK_OO = 2, + WHITE_OOO = 4, + BLACK_OOO = 8, + ALL_CASTLES = 15 +}; + /// Score enum keeps a midgame and an endgame value in a single /// integer (enum), first LSB 16 bits are used to store endgame @@ -272,10 +320,10 @@ inline T operator/ (const T d, int i) { return T(int(d) / i); } \ inline T operator- (const T d) { return T(-int(d)); } \ inline T operator++ (T& d, int) {d = T(int(d) + 1); return d; } \ inline T operator-- (T& d, int) { d = T(int(d) - 1); return d; } \ -inline void operator+= (T& d1, const T d2) { d1 = d1 + d2; } \ -inline void operator-= (T& d1, const T d2) { d1 = d1 - d2; } \ -inline void operator*= (T& d, int i) { d = T(int(d) * i); } \ -inline void operator/= (T& d, int i) { d = T(int(d) / i); } +inline T& operator+= (T& d1, const T d2) { d1 = d1 + d2; return d1; } \ +inline T& operator-= (T& d1, const T d2) { d1 = d1 - d2; return d1; } \ +inline T& operator*= (T& d, int i) { d = T(int(d) * i); return d; } \ +inline T& operator/= (T& d, int i) { d = T(int(d) / i); return d; } ENABLE_OPERATORS_ON(Value) ENABLE_OPERATORS_ON(PieceType) @@ -336,11 +384,15 @@ const Value RookValueEndgame = Value(0x4FE); const Value QueenValueMidgame = Value(0x9D9); const Value QueenValueEndgame = Value(0x9FE); -inline Value value_mate_in(int ply) { +extern const Value PieceValueMidgame[17]; +extern const Value PieceValueEndgame[17]; +extern int SquareDistance[64][64]; + +inline Value mate_in(int ply) { return VALUE_MATE - ply; } -inline Value value_mated_in(int ply) { +inline Value mated_in(int ply) { return -VALUE_MATE + ply; } @@ -348,23 +400,18 @@ inline Piece make_piece(Color c, PieceType pt) { return Piece((c << 3) | pt); } -inline PieceType type_of_piece(Piece p) { +inline PieceType type_of(Piece p) { return PieceType(p & 7); } -inline Color color_of_piece(Piece p) { +inline Color color_of(Piece p) { return Color(p >> 3); } -inline Color opposite_color(Color c) { +inline Color flip(Color c) { return Color(c ^ 1); } -inline char piece_type_to_char(PieceType pt) { - static const char ch[] = " PNBRQK"; - return ch[pt]; -} - inline Square make_square(File f, Rank r) { return Square((r << 3) | f); } @@ -373,19 +420,19 @@ inline bool square_is_ok(Square s) { return s >= SQ_A1 && s <= SQ_H8; } -inline File square_file(Square s) { +inline File file_of(Square s) { return File(s & 7); } -inline Rank square_rank(Square s) { +inline Rank rank_of(Square s) { return Rank(s >> 3); } -inline Square flip_square(Square s) { +inline Square flip(Square s) { return Square(s ^ 56); } -inline Square flop_square(Square s) { +inline Square mirror(Square s) { return Square(s ^ 7); } @@ -398,28 +445,28 @@ inline Rank relative_rank(Color c, Rank r) { } inline Rank relative_rank(Color c, Square s) { - return relative_rank(c, square_rank(s)); + return relative_rank(c, rank_of(s)); } -inline SquareColor square_color(Square s) { - return SquareColor(int(square_rank(s) + s) & 1); -} - -inline bool opposite_color_squares(Square s1, Square s2) { +inline bool opposite_colors(Square s1, Square s2) { int s = s1 ^ s2; return ((s >> 3) ^ s) & 1; } inline int file_distance(Square s1, Square s2) { - return abs(square_file(s1) - square_file(s2)); + return abs(file_of(s1) - file_of(s2)); } inline int rank_distance(Square s1, Square s2) { - return abs(square_rank(s1) - square_rank(s2)); + return abs(rank_of(s1) - rank_of(s2)); } inline int square_distance(Square s1, Square s2) { - return Max(file_distance(s1, s2), rank_distance(s1, s2)); + return SquareDistance[s1][s2]; +} + +inline char piece_type_to_char(PieceType pt) { + return " PNBRQK"[pt]; } inline char file_to_char(File f) { @@ -431,12 +478,81 @@ inline char rank_to_char(Rank r) { } inline const std::string square_to_string(Square s) { - char ch[] = { file_to_char(square_file(s)), rank_to_char(square_rank(s)), 0 }; - return std::string(ch); + char ch[] = { file_to_char(file_of(s)), rank_to_char(rank_of(s)), 0 }; + return ch; } inline Square pawn_push(Color c) { return c == WHITE ? DELTA_N : DELTA_S; } +// An helper insertion sort implementation, works with pointers and iterators +template +inline void sort(K firstMove, K lastMove) +{ + T value; + K cur, p, d; + + if (firstMove != lastMove) + for (cur = firstMove + 1; cur != lastMove; cur++) + { + p = d = cur; + value = *p--; + if (*p < value) + { + do *d = *p; + while (--d != firstMove && *--p < value); + *d = value; + } + } +} + +inline Square move_from(Move m) { + return Square((m >> 6) & 0x3F); +} + +inline Square move_to(Move m) { + return Square(m & 0x3F); +} + +inline bool is_special(Move m) { + return m & (3 << 14); +} + +inline bool is_promotion(Move m) { + return (m & (3 << 14)) == (1 << 14); +} + +inline int is_enpassant(Move m) { + return (m & (3 << 14)) == (2 << 14); +} + +inline int is_castle(Move m) { + return (m & (3 << 14)) == (3 << 14); +} + +inline PieceType promotion_piece_type(Move m) { + return PieceType(((m >> 12) & 3) + 2); +} + +inline Move make_move(Square from, Square to) { + return Move(to | (from << 6)); +} + +inline Move make_promotion_move(Square from, Square to, PieceType promotion) { + return Move(to | (from << 6) | (1 << 14) | ((promotion - 2) << 12)) ; +} + +inline Move make_enpassant_move(Square from, Square to) { + return Move(to | (from << 6) | (2 << 14)); +} + +inline Move make_castle_move(Square from, Square to) { + return Move(to | (from << 6) | (3 << 14)); +} + +inline bool is_ok(Move m) { + return move_from(m) != move_to(m); // Catches also MOVE_NULL and MOVE_NONE +} + #endif // !defined(TYPES_H_INCLUDED)