Subversion Repositories Games.Chess Giants

Rev

Rev 154 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /*
  2.   Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  3.   Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
  4.   Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
  5.   Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
  6.  
  7.   Stockfish is free software: you can redistribute it and/or modify
  8.   it under the terms of the GNU General Public License as published by
  9.   the Free Software Foundation, either version 3 of the License, or
  10.   (at your option) any later version.
  11.  
  12.   Stockfish is distributed in the hope that it will be useful,
  13.   but WITHOUT ANY WARRANTY; without even the implied warranty of
  14.   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15.   GNU General Public License for more details.
  16.  
  17.   You should have received a copy of the GNU General Public License
  18.   along with this program.  If not, see <http://www.gnu.org/licenses/>.
  19. */
  20.  
  21. #ifndef TYPES_H_INCLUDED
  22. #define TYPES_H_INCLUDED
  23.  
  24. /// When compiling with provided Makefile (e.g. for Linux and OSX), configuration
  25. /// is done automatically. To get started type 'make help'.
  26. ///
  27. /// When Makefile is not used (e.g. with Microsoft Visual Studio) some switches
  28. /// need to be set manually:
  29. ///
  30. /// -DNDEBUG      | Disable debugging mode. Always use this for release.
  31. ///
  32. /// -DNO_PREFETCH | Disable use of prefetch asm-instruction. You may need this to
  33. ///               | run on some very old machines.
  34. ///
  35. /// -DUSE_POPCNT  | Add runtime support for use of popcnt asm-instruction. Works
  36. ///               | only in 64-bit mode and requires hardware with popcnt support.
  37. ///
  38. /// -DUSE_PEXT    | Add runtime support for use of pext asm-instruction. Works
  39. ///               | only in 64-bit mode and requires hardware with pext support.
  40.  
  41. #include <cassert>
  42. #include <cctype>
  43. #include <climits>
  44. #include <cstdint>
  45. #include <cstdlib>
  46.  
  47. #if defined(_MSC_VER)
  48. // Disable some silly and noisy warning from MSVC compiler
  49. #pragma warning(disable: 4127) // Conditional expression is constant
  50. #pragma warning(disable: 4146) // Unary minus operator applied to unsigned type
  51. #pragma warning(disable: 4800) // Forcing value to bool 'true' or 'false'
  52. #include <intrin.h> // Pierre-Marie Baty -- for popcnt()
  53. #endif
  54.  
  55. /// Predefined macros hell:
  56. ///
  57. /// __GNUC__           Compiler is gcc, Clang or Intel on Linux
  58. /// __INTEL_COMPILER   Compiler is Intel
  59. /// _MSC_VER           Compiler is MSVC or Intel on Windows
  60. /// _WIN32             Building on Windows (any)
  61. /// _WIN64             Building on Windows 64 bit
  62.  
  63. #if defined(_WIN64) && defined(_MSC_VER) // No Makefile used
  64. #  include <intrin.h> // MSVC popcnt and bsfq instrinsics
  65. #  define IS_64BIT
  66. #  define USE_BSFQ
  67. #endif
  68.  
  69. #if defined(USE_POPCNT) && defined(__INTEL_COMPILER) && defined(_MSC_VER)
  70. #  include <nmmintrin.h> // Intel header for _mm_popcnt_u64() intrinsic
  71. #endif
  72.  
  73. #if !defined(NO_PREFETCH) && (defined(__INTEL_COMPILER) || defined(_MSC_VER))
  74. #  include <xmmintrin.h> // Intel and Microsoft header for _mm_prefetch()
  75. #endif
  76.  
  77. #if defined(USE_PEXT)
  78. #  include <immintrin.h> // Header for _pext_u64() intrinsic
  79. #  define pext(b, m) _pext_u64(b, m)
  80. #else
  81. #  define pext(b, m) (0)
  82. #endif
  83.  
  84. #ifdef USE_POPCNT
  85. const bool HasPopCnt = true;
  86. #else
  87. const bool HasPopCnt = false;
  88. #endif
  89.  
  90. #ifdef USE_PEXT
  91. const bool HasPext = true;
  92. #else
  93. const bool HasPext = false;
  94. #endif
  95.  
  96. #ifdef IS_64BIT
  97. const bool Is64Bit = true;
  98. #else
  99. const bool Is64Bit = false;
  100. #endif
  101.  
  102. typedef uint64_t Key;
  103. typedef uint64_t Bitboard;
  104.  
  105. const int MAX_MOVES = 256;
  106. const int MAX_PLY   = 128;
  107.  
  108. /// A move needs 16 bits to be stored
  109. ///
  110. /// bit  0- 5: destination square (from 0 to 63)
  111. /// bit  6-11: origin square (from 0 to 63)
  112. /// bit 12-13: promotion piece type - 2 (from KNIGHT-2 to QUEEN-2)
  113. /// bit 14-15: special move flag: promotion (1), en passant (2), castling (3)
  114. /// NOTE: EN-PASSANT bit is set only when a pawn can be captured
  115. ///
  116. /// Special cases are MOVE_NONE and MOVE_NULL. We can sneak these in because in
  117. /// any normal move destination square is always different from origin square
  118. /// while MOVE_NONE and MOVE_NULL have the same origin and destination square.
  119.  
  120. enum Move {
  121.   MOVE_NONE,
  122.   MOVE_NULL = 65
  123. };
  124.  
  125. enum MoveType {
  126.   NORMAL,
  127.   PROMOTION = 1 << 14,
  128.   ENPASSANT = 2 << 14,
  129.   CASTLING  = 3 << 14
  130. };
  131.  
  132. enum Color {
  133.   WHITE, BLACK, NO_COLOR, COLOR_NB = 2
  134. };
  135.  
  136. enum CastlingSide {
  137.   KING_SIDE, QUEEN_SIDE, CASTLING_SIDE_NB = 2
  138. };
  139.  
  140. enum CastlingRight {
  141.   NO_CASTLING,
  142.   WHITE_OO,
  143.   WHITE_OOO = WHITE_OO << 1,
  144.   BLACK_OO  = WHITE_OO << 2,
  145.   BLACK_OOO = WHITE_OO << 3,
  146.   ANY_CASTLING = WHITE_OO | WHITE_OOO | BLACK_OO | BLACK_OOO,
  147.   CASTLING_RIGHT_NB = 16
  148. };
  149.  
  150. template<Color C, CastlingSide S> struct MakeCastling {
  151.   static const CastlingRight
  152.   right = C == WHITE ? S == QUEEN_SIDE ? WHITE_OOO : WHITE_OO
  153.                      : S == QUEEN_SIDE ? BLACK_OOO : BLACK_OO;
  154. };
  155.  
  156. enum Phase {
  157.   PHASE_ENDGAME,
  158.   PHASE_MIDGAME = 128,
  159.   MG = 0, EG = 1, PHASE_NB = 2
  160. };
  161.  
  162. enum ScaleFactor {
  163.   SCALE_FACTOR_DRAW    = 0,
  164.   SCALE_FACTOR_ONEPAWN = 48,
  165.   SCALE_FACTOR_NORMAL  = 64,
  166.   SCALE_FACTOR_MAX     = 128,
  167.   SCALE_FACTOR_NONE    = 255
  168. };
  169.  
  170. enum Bound {
  171.   BOUND_NONE,
  172.   BOUND_UPPER,
  173.   BOUND_LOWER,
  174.   BOUND_EXACT = BOUND_UPPER | BOUND_LOWER
  175. };
  176.  
  177. enum Value : int {
  178.   VALUE_ZERO      = 0,
  179.   VALUE_DRAW      = 0,
  180.   VALUE_KNOWN_WIN = 10000,
  181.   VALUE_MATE      = 32000,
  182.   VALUE_INFINITE  = 32001,
  183.   VALUE_NONE      = 32002,
  184.  
  185.   VALUE_MATE_IN_MAX_PLY  =  VALUE_MATE - 2 * MAX_PLY,
  186.   VALUE_MATED_IN_MAX_PLY = -VALUE_MATE + 2 * MAX_PLY,
  187.  
  188.   PawnValueMg   = 198,   PawnValueEg   = 258,
  189.   KnightValueMg = 817,   KnightValueEg = 846,
  190.   BishopValueMg = 836,   BishopValueEg = 857,
  191.   RookValueMg   = 1270,  RookValueEg   = 1281,
  192.   QueenValueMg  = 2521,  QueenValueEg  = 2558,
  193.  
  194.   MidgameLimit  = 15581, EndgameLimit  = 3998
  195. };
  196.  
  197. enum PieceType {
  198.   NO_PIECE_TYPE, PAWN, KNIGHT, BISHOP, ROOK, QUEEN, KING,
  199.   ALL_PIECES = 0,
  200.   PIECE_TYPE_NB = 8
  201. };
  202.  
  203. enum Piece {
  204.   NO_PIECE,
  205.   W_PAWN = 1, W_KNIGHT, W_BISHOP, W_ROOK, W_QUEEN, W_KING,
  206.   B_PAWN = 9, B_KNIGHT, B_BISHOP, B_ROOK, B_QUEEN, B_KING,
  207.   PIECE_NB = 16
  208. };
  209.  
  210. enum Depth {
  211.  
  212.   ONE_PLY = 1,
  213.  
  214.   DEPTH_ZERO          =  0,
  215.   DEPTH_QS_CHECKS     =  0,
  216.   DEPTH_QS_NO_CHECKS  = -1,
  217.   DEPTH_QS_RECAPTURES = -5,
  218.  
  219.   DEPTH_NONE = -6,
  220.   DEPTH_MAX  = MAX_PLY
  221. };
  222.  
  223. enum Square {
  224.   SQ_A1, SQ_B1, SQ_C1, SQ_D1, SQ_E1, SQ_F1, SQ_G1, SQ_H1,
  225.   SQ_A2, SQ_B2, SQ_C2, SQ_D2, SQ_E2, SQ_F2, SQ_G2, SQ_H2,
  226.   SQ_A3, SQ_B3, SQ_C3, SQ_D3, SQ_E3, SQ_F3, SQ_G3, SQ_H3,
  227.   SQ_A4, SQ_B4, SQ_C4, SQ_D4, SQ_E4, SQ_F4, SQ_G4, SQ_H4,
  228.   SQ_A5, SQ_B5, SQ_C5, SQ_D5, SQ_E5, SQ_F5, SQ_G5, SQ_H5,
  229.   SQ_A6, SQ_B6, SQ_C6, SQ_D6, SQ_E6, SQ_F6, SQ_G6, SQ_H6,
  230.   SQ_A7, SQ_B7, SQ_C7, SQ_D7, SQ_E7, SQ_F7, SQ_G7, SQ_H7,
  231.   SQ_A8, SQ_B8, SQ_C8, SQ_D8, SQ_E8, SQ_F8, SQ_G8, SQ_H8,
  232.   SQ_NONE,
  233.  
  234.   SQUARE_NB = 64,
  235.  
  236.   DELTA_N =  8,
  237.   DELTA_E =  1,
  238.   DELTA_S = -8,
  239.   DELTA_W = -1,
  240.  
  241.   DELTA_NN = DELTA_N + DELTA_N,
  242.   DELTA_NE = DELTA_N + DELTA_E,
  243.   DELTA_SE = DELTA_S + DELTA_E,
  244.   DELTA_SS = DELTA_S + DELTA_S,
  245.   DELTA_SW = DELTA_S + DELTA_W,
  246.   DELTA_NW = DELTA_N + DELTA_W
  247. };
  248.  
  249. enum File {
  250.   FILE_A, FILE_B, FILE_C, FILE_D, FILE_E, FILE_F, FILE_G, FILE_H, FILE_NB
  251. };
  252.  
  253. enum Rank {
  254.   RANK_1, RANK_2, RANK_3, RANK_4, RANK_5, RANK_6, RANK_7, RANK_8, RANK_NB
  255. };
  256.  
  257.  
  258. /// Score enum stores a middlegame and an endgame value in a single integer
  259. /// (enum). The least significant 16 bits are used to store the endgame value
  260. /// and the upper 16 bits are used to store the middlegame value.
  261. enum Score : int { SCORE_ZERO };
  262.  
  263. inline Score make_score(int mg, int eg) {
  264.   return Score((mg << 16) + eg);
  265. }
  266.  
  267. /// Extracting the signed lower and upper 16 bits is not so trivial because
  268. /// according to the standard a simple cast to short is implementation defined
  269. /// and so is a right shift of a signed integer.
  270. inline Value mg_value(Score s) {
  271.  
  272.   union { uint16_t u; int16_t s; } mg = { uint16_t(unsigned(s + 0x8000) >> 16) };
  273.   return Value(mg.s);
  274. }
  275.  
  276. inline Value eg_value(Score s) {
  277.  
  278.   union { uint16_t u; int16_t s; } eg = { uint16_t(unsigned(s)) };
  279.   return Value(eg.s);
  280. }
  281.  
  282. #define ENABLE_BASE_OPERATORS_ON(T)                             \
  283. inline T operator+(T d1, T d2) { return T(int(d1) + int(d2)); } \
  284. inline T operator-(T d1, T d2) { return T(int(d1) - int(d2)); } \
  285. inline T operator*(int i, T d) { return T(i * int(d)); }        \
  286. inline T operator*(T d, int i) { return T(int(d) * i); }        \
  287. inline T operator-(T d) { return T(-int(d)); }                  \
  288. inline T& operator+=(T& d1, T d2) { return d1 = d1 + d2; }      \
  289. inline T& operator-=(T& d1, T d2) { return d1 = d1 - d2; }      \
  290. inline T& operator*=(T& d, int i) { return d = T(int(d) * i); }
  291.  
  292. #define ENABLE_FULL_OPERATORS_ON(T)                             \
  293. ENABLE_BASE_OPERATORS_ON(T)                                     \
  294. inline T& operator++(T& d) { return d = T(int(d) + 1); }        \
  295. inline T& operator--(T& d) { return d = T(int(d) - 1); }        \
  296. inline T operator/(T d, int i) { return T(int(d) / i); }        \
  297. inline int operator/(T d1, T d2) { return int(d1) / int(d2); }  \
  298. inline T& operator/=(T& d, int i) { return d = T(int(d) / i); }
  299.  
  300. ENABLE_FULL_OPERATORS_ON(Value)
  301. ENABLE_FULL_OPERATORS_ON(PieceType)
  302. ENABLE_FULL_OPERATORS_ON(Piece)
  303. ENABLE_FULL_OPERATORS_ON(Color)
  304. ENABLE_FULL_OPERATORS_ON(Depth)
  305. ENABLE_FULL_OPERATORS_ON(Square)
  306. ENABLE_FULL_OPERATORS_ON(File)
  307. ENABLE_FULL_OPERATORS_ON(Rank)
  308.  
  309. ENABLE_BASE_OPERATORS_ON(Score)
  310.  
  311. #undef ENABLE_FULL_OPERATORS_ON
  312. #undef ENABLE_BASE_OPERATORS_ON
  313.  
  314. /// Additional operators to add integers to a Value
  315. inline Value operator+(Value v, int i) { return Value(int(v) + i); }
  316. inline Value operator-(Value v, int i) { return Value(int(v) - i); }
  317. inline Value& operator+=(Value& v, int i) { return v = v + i; }
  318. inline Value& operator-=(Value& v, int i) { return v = v - i; }
  319.  
  320. /// Only declared but not defined. We don't want to multiply two scores due to
  321. /// a very high risk of overflow. So user should explicitly convert to integer.
  322. inline Score operator*(Score s1, Score s2);
  323.  
  324. /// Division of a Score must be handled separately for each term
  325. inline Score operator/(Score s, int i) {
  326.   return make_score(mg_value(s) / i, eg_value(s) / i);
  327. }
  328.  
  329. extern Value PieceValue[PHASE_NB][PIECE_NB];
  330.  
  331. inline Color operator~(Color c) {
  332.   return Color(c ^ BLACK);
  333. }
  334.  
  335. inline Square operator~(Square s) {
  336.   return Square(s ^ SQ_A8); // Vertical flip SQ_A1 -> SQ_A8
  337. }
  338.  
  339. inline CastlingRight operator|(Color c, CastlingSide s) {
  340.   return CastlingRight(WHITE_OO << ((s == QUEEN_SIDE) + 2 * c));
  341. }
  342.  
  343. inline Value mate_in(int ply) {
  344.   return VALUE_MATE - ply;
  345. }
  346.  
  347. inline Value mated_in(int ply) {
  348.   return -VALUE_MATE + ply;
  349. }
  350.  
  351. inline Square make_square(File f, Rank r) {
  352.   return Square((r << 3) | f);
  353. }
  354.  
  355. inline Piece make_piece(Color c, PieceType pt) {
  356.   return Piece((c << 3) | pt);
  357. }
  358.  
  359. inline PieceType type_of(Piece pc)  {
  360.   return PieceType(pc & 7);
  361. }
  362.  
  363. inline Color color_of(Piece pc) {
  364.   assert(pc != NO_PIECE);
  365.   return Color(pc >> 3);
  366. }
  367.  
  368. inline bool is_ok(Square s) {
  369.   return s >= SQ_A1 && s <= SQ_H8;
  370. }
  371.  
  372. inline File file_of(Square s) {
  373.   return File(s & 7);
  374. }
  375.  
  376. inline Rank rank_of(Square s) {
  377.   return Rank(s >> 3);
  378. }
  379.  
  380. inline Square relative_square(Color c, Square s) {
  381.   return Square(s ^ (c * 56));
  382. }
  383.  
  384. inline Rank relative_rank(Color c, Rank r) {
  385.   return Rank(r ^ (c * 7));
  386. }
  387.  
  388. inline Rank relative_rank(Color c, Square s) {
  389.   return relative_rank(c, rank_of(s));
  390. }
  391.  
  392. inline bool opposite_colors(Square s1, Square s2) {
  393.   int s = int(s1) ^ int(s2);
  394.   return ((s >> 3) ^ s) & 1;
  395. }
  396.  
  397. inline Square pawn_push(Color c) {
  398.   return c == WHITE ? DELTA_N : DELTA_S;
  399. }
  400.  
  401. inline Square from_sq(Move m) {
  402.   return Square((m >> 6) & 0x3F);
  403. }
  404.  
  405. inline Square to_sq(Move m) {
  406.   return Square(m & 0x3F);
  407. }
  408.  
  409. inline MoveType type_of(Move m) {
  410.   return MoveType(m & (3 << 14));
  411. }
  412.  
  413. inline PieceType promotion_type(Move m) {
  414.   return PieceType(((m >> 12) & 3) + KNIGHT);
  415. }
  416.  
  417. inline Move make_move(Square from, Square to) {
  418.   return Move(to | (from << 6));
  419. }
  420.  
  421. template<MoveType T>
  422. inline Move make(Square from, Square to, PieceType pt = KNIGHT) {
  423.   return Move(to | (from << 6) | T | ((pt - KNIGHT) << 12));
  424. }
  425.  
  426. inline bool is_ok(Move m) {
  427.   return from_sq(m) != to_sq(m); // Catch MOVE_NULL and MOVE_NONE
  428. }
  429.  
  430. #endif // #ifndef TYPES_H_INCLUDED
  431.