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-2012 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
20 #if !defined(TYPES_H_INCLUDED)
21 #define TYPES_H_INCLUDED
23 /// For Linux and OSX configuration is done automatically using Makefile. To get
24 /// started type 'make help'.
26 /// For Windows, part of the configuration is detected automatically, but some
27 /// switches need to be set manually:
29 /// -DNDEBUG | Disable debugging mode. Use always.
31 /// -DNO_PREFETCH | Disable use of prefetch asm-instruction. A must if you want
32 /// | the executable to run on some very old machines.
34 /// -DUSE_POPCNT | Add runtime support for use of popcnt asm-instruction. Works
35 /// | only in 64-bit mode. For compiling requires hardware with
44 #if defined(_WIN64) && !defined(IS_64BIT)
45 # include <intrin.h> // MSVC popcnt and bsfq instrinsics
50 #if defined(USE_POPCNT) && defined(_MSC_VER) && defined(__INTEL_COMPILER)
51 # include <nmmintrin.h> // Intel header for _mm_popcnt_u64() intrinsic
54 # if !defined(NO_PREFETCH) && (defined(__INTEL_COMPILER) || defined(_MSC_VER))
55 # include <xmmintrin.h> // Intel and Microsoft header for _mm_prefetch()
58 #if defined(_MSC_VER) || defined(__INTEL_COMPILER)
59 # define CACHE_LINE_ALIGNMENT __declspec(align(64))
61 # define CACHE_LINE_ALIGNMENT __attribute__ ((aligned(64)))
65 # define FORCE_INLINE __forceinline
66 #elif defined(__GNUC__)
67 # define FORCE_INLINE inline __attribute__((always_inline))
69 # define FORCE_INLINE inline
72 #if defined(USE_POPCNT)
73 const bool HasPopCnt = true;
75 const bool HasPopCnt = false;
79 const bool Is64Bit = true;
81 const bool Is64Bit = false;
85 typedef uint64_t Bitboard;
87 const int MAX_MOVES = 192;
88 const int MAX_PLY = 100;
89 const int MAX_PLY_PLUS_2 = MAX_PLY + 2;
91 const Bitboard FileABB = 0x0101010101010101ULL;
92 const Bitboard FileBBB = FileABB << 1;
93 const Bitboard FileCBB = FileABB << 2;
94 const Bitboard FileDBB = FileABB << 3;
95 const Bitboard FileEBB = FileABB << 4;
96 const Bitboard FileFBB = FileABB << 5;
97 const Bitboard FileGBB = FileABB << 6;
98 const Bitboard FileHBB = FileABB << 7;
100 const Bitboard Rank1BB = 0xFF;
101 const Bitboard Rank2BB = Rank1BB << (8 * 1);
102 const Bitboard Rank3BB = Rank1BB << (8 * 2);
103 const Bitboard Rank4BB = Rank1BB << (8 * 3);
104 const Bitboard Rank5BB = Rank1BB << (8 * 4);
105 const Bitboard Rank6BB = Rank1BB << (8 * 5);
106 const Bitboard Rank7BB = Rank1BB << (8 * 6);
107 const Bitboard Rank8BB = Rank1BB << (8 * 7);
110 /// A move needs 16 bits to be stored
112 /// bit 0- 5: destination square (from 0 to 63)
113 /// bit 6-11: origin square (from 0 to 63)
114 /// bit 12-13: promotion piece type - 2 (from KNIGHT-2 to QUEEN-2)
115 /// bit 14-15: special move flag: promotion (1), en passant (2), castle (3)
117 /// Special cases are MOVE_NONE and MOVE_NULL. We can sneak these in because in
118 /// any normal move destination square is always different from origin square
119 /// while MOVE_NONE and MOVE_NULL have the same origin and destination square.
133 enum CastleRight { // Defined as in PolyGlot book hash key
148 SCALE_FACTOR_DRAW = 0,
149 SCALE_FACTOR_NORMAL = 64,
150 SCALE_FACTOR_MAX = 128,
151 SCALE_FACTOR_NONE = 255
158 BOUND_EXACT = BOUND_UPPER | BOUND_LOWER
164 VALUE_KNOWN_WIN = 15000,
166 VALUE_INFINITE = 30001,
169 VALUE_MATE_IN_MAX_PLY = VALUE_MATE - MAX_PLY,
170 VALUE_MATED_IN_MAX_PLY = -VALUE_MATE + MAX_PLY,
172 VALUE_ENSURE_INTEGER_SIZE_P = INT_MAX,
173 VALUE_ENSURE_INTEGER_SIZE_N = INT_MIN,
177 PawnValueMg = 198, PawnValueEg = 258,
178 KnightValueMg = 817, KnightValueEg = 846,
179 BishopValueMg = 836, BishopValueEg = 857,
180 RookValueMg = 1270, RookValueEg = 1278,
181 QueenValueMg = 2521, QueenValueEg = 2558
185 NO_PIECE_TYPE = 0, ALL_PIECES = 0,
186 PAWN = 1, KNIGHT = 2, BISHOP = 3, ROOK = 4, QUEEN = 5, KING = 6
190 NO_PIECE = 16, // color_of(NO_PIECE) == NO_COLOR
191 W_PAWN = 1, W_KNIGHT = 2, W_BISHOP = 3, W_ROOK = 4, W_QUEEN = 5, W_KING = 6,
192 B_PAWN = 9, B_KNIGHT = 10, B_BISHOP = 11, B_ROOK = 12, B_QUEEN = 13, B_KING = 14
196 WHITE, BLACK, NO_COLOR
203 DEPTH_ZERO = 0 * ONE_PLY,
204 DEPTH_QS_CHECKS = -1 * ONE_PLY,
205 DEPTH_QS_NO_CHECKS = -2 * ONE_PLY,
206 DEPTH_QS_RECAPTURES = -5 * ONE_PLY,
208 DEPTH_NONE = -127 * ONE_PLY
212 SQ_A1, SQ_B1, SQ_C1, SQ_D1, SQ_E1, SQ_F1, SQ_G1, SQ_H1,
213 SQ_A2, SQ_B2, SQ_C2, SQ_D2, SQ_E2, SQ_F2, SQ_G2, SQ_H2,
214 SQ_A3, SQ_B3, SQ_C3, SQ_D3, SQ_E3, SQ_F3, SQ_G3, SQ_H3,
215 SQ_A4, SQ_B4, SQ_C4, SQ_D4, SQ_E4, SQ_F4, SQ_G4, SQ_H4,
216 SQ_A5, SQ_B5, SQ_C5, SQ_D5, SQ_E5, SQ_F5, SQ_G5, SQ_H5,
217 SQ_A6, SQ_B6, SQ_C6, SQ_D6, SQ_E6, SQ_F6, SQ_G6, SQ_H6,
218 SQ_A7, SQ_B7, SQ_C7, SQ_D7, SQ_E7, SQ_F7, SQ_G7, SQ_H7,
219 SQ_A8, SQ_B8, SQ_C8, SQ_D8, SQ_E8, SQ_F8, SQ_G8, SQ_H8,
227 DELTA_NN = DELTA_N + DELTA_N,
228 DELTA_NE = DELTA_N + DELTA_E,
229 DELTA_SE = DELTA_S + DELTA_E,
230 DELTA_SS = DELTA_S + DELTA_S,
231 DELTA_SW = DELTA_S + DELTA_W,
232 DELTA_NW = DELTA_N + DELTA_W
236 FILE_A, FILE_B, FILE_C, FILE_D, FILE_E, FILE_F, FILE_G, FILE_H
240 RANK_1, RANK_2, RANK_3, RANK_4, RANK_5, RANK_6, RANK_7, RANK_8
244 /// Score enum keeps a midgame and an endgame value in a single integer (enum),
245 /// first LSB 16 bits are used to store endgame value, while upper bits are used
246 /// for midgame value. Compiler is free to choose the enum type as long as can
247 /// keep its data, so ensure Score to be an integer type.
250 SCORE_ENSURE_INTEGER_SIZE_P = INT_MAX,
251 SCORE_ENSURE_INTEGER_SIZE_N = INT_MIN
254 inline Score make_score(int mg, int eg) { return Score((mg << 16) + eg); }
256 /// Extracting the signed lower and upper 16 bits it not so trivial because
257 /// according to the standard a simple cast to short is implementation defined
258 /// and so is a right shift of a signed integer.
259 inline Value mg_value(Score s) { return Value(((s + 32768) & ~0xffff) / 0x10000); }
261 /// On Intel 64 bit we have a small speed regression with the standard conforming
262 /// version, so use a faster code in this case that, although not 100% standard
263 /// compliant it seems to work for Intel and MSVC.
264 #if defined(IS_64BIT) && (!defined(__GNUC__) || defined(__INTEL_COMPILER))
266 inline Value eg_value(Score s) { return Value(int16_t(s & 0xffff)); }
270 inline Value eg_value(Score s) {
271 return Value((int)(unsigned(s) & 0x7fffu) - (int)(unsigned(s) & 0x8000u));
276 #define ENABLE_SAFE_OPERATORS_ON(T) \
277 inline T operator+(const T d1, const T d2) { return T(int(d1) + int(d2)); } \
278 inline T operator-(const T d1, const T d2) { return T(int(d1) - int(d2)); } \
279 inline T operator*(int i, const T d) { return T(i * int(d)); } \
280 inline T operator*(const T d, int i) { return T(int(d) * i); } \
281 inline T operator-(const T d) { return T(-int(d)); } \
282 inline T& operator+=(T& d1, const T d2) { d1 = d1 + d2; return d1; } \
283 inline T& operator-=(T& d1, const T d2) { d1 = d1 - d2; return d1; } \
284 inline T& operator*=(T& d, int i) { d = T(int(d) * i); return d; }
286 #define ENABLE_OPERATORS_ON(T) ENABLE_SAFE_OPERATORS_ON(T) \
287 inline T operator++(T& d, int) { d = T(int(d) + 1); return d; } \
288 inline T operator--(T& d, int) { d = T(int(d) - 1); return d; } \
289 inline T operator/(const T d, int i) { return T(int(d) / i); } \
290 inline T& operator/=(T& d, int i) { d = T(int(d) / i); return d; }
292 ENABLE_OPERATORS_ON(Value)
293 ENABLE_OPERATORS_ON(PieceType)
294 ENABLE_OPERATORS_ON(Piece)
295 ENABLE_OPERATORS_ON(Color)
296 ENABLE_OPERATORS_ON(Depth)
297 ENABLE_OPERATORS_ON(Square)
298 ENABLE_OPERATORS_ON(File)
299 ENABLE_OPERATORS_ON(Rank)
301 /// Added operators for adding integers to a Value
302 inline Value operator+(Value v, int i) { return Value(int(v) + i); }
303 inline Value operator-(Value v, int i) { return Value(int(v) - i); }
305 ENABLE_SAFE_OPERATORS_ON(Score)
307 /// Only declared but not defined. We don't want to multiply two scores due to
308 /// a very high risk of overflow. So user should explicitly convert to integer.
309 inline Score operator*(Score s1, Score s2);
311 /// Division of a Score must be handled separately for each term
312 inline Score operator/(Score s, int i) {
313 return make_score(mg_value(s) / i, eg_value(s) / i);
316 /// Weight score v by score w trying to prevent overflow
317 inline Score apply_weight(Score v, Score w) {
318 return make_score((int(mg_value(v)) * mg_value(w)) / 0x100,
319 (int(eg_value(v)) * eg_value(w)) / 0x100);
322 #undef ENABLE_OPERATORS_ON
323 #undef ENABLE_SAFE_OPERATORS_ON
327 extern Key psq[2][8][64]; // [color][pieceType][square / piece count]
328 extern Key enpassant[8]; // [file]
329 extern Key castle[16]; // [castleRight]
331 extern Key exclusion;
338 extern Score pieceSquareTable[16][64]; // [piece][square]
339 extern Value PieceValue[2][18]; // [Mg / Eg][piece / pieceType]
340 extern int SquareDistance[64][64]; // [square][square]
347 inline bool operator<(const MoveStack& f, const MoveStack& s) {
348 return f.score < s.score;
351 inline Color operator~(Color c) {
355 inline Square operator~(Square s) {
356 return Square(s ^ 56); // Vertical flip SQ_A1 -> SQ_A8
359 inline Square operator|(File f, Rank r) {
360 return Square((r << 3) | f);
363 inline Value mate_in(int ply) {
364 return VALUE_MATE - ply;
367 inline Value mated_in(int ply) {
368 return -VALUE_MATE + ply;
371 inline Piece make_piece(Color c, PieceType pt) {
372 return Piece((c << 3) | pt);
375 inline CastleRight make_castle_right(Color c, CastlingSide s) {
376 return CastleRight(WHITE_OO << ((s == QUEEN_SIDE) + 2 * c));
379 inline PieceType type_of(Piece p) {
380 return PieceType(p & 7);
383 inline Color color_of(Piece p) {
384 return Color(p >> 3);
387 inline bool is_ok(Square s) {
388 return s >= SQ_A1 && s <= SQ_H8;
391 inline File file_of(Square s) {
395 inline Rank rank_of(Square s) {
399 inline Square mirror(Square s) {
400 return Square(s ^ 7); // Horizontal flip SQ_A1 -> SQ_H1
403 inline Square relative_square(Color c, Square s) {
404 return Square(s ^ (c * 56));
407 inline Rank relative_rank(Color c, Rank r) {
408 return Rank(r ^ (c * 7));
411 inline Rank relative_rank(Color c, Square s) {
412 return relative_rank(c, rank_of(s));
415 inline bool opposite_colors(Square s1, Square s2) {
416 int s = int(s1) ^ int(s2);
417 return ((s >> 3) ^ s) & 1;
420 inline int file_distance(Square s1, Square s2) {
421 return abs(file_of(s1) - file_of(s2));
424 inline int rank_distance(Square s1, Square s2) {
425 return abs(rank_of(s1) - rank_of(s2));
428 inline int square_distance(Square s1, Square s2) {
429 return SquareDistance[s1][s2];
432 inline char file_to_char(File f) {
433 return char(f - FILE_A + int('a'));
436 inline char rank_to_char(Rank r) {
437 return char(r - RANK_1 + int('1'));
440 inline Square pawn_push(Color c) {
441 return c == WHITE ? DELTA_N : DELTA_S;
444 inline Square from_sq(Move m) {
445 return Square((m >> 6) & 0x3F);
448 inline Square to_sq(Move m) {
449 return Square(m & 0x3F);
452 inline MoveType type_of(Move m) {
453 return MoveType(m & (3 << 14));
456 inline PieceType promotion_type(Move m) {
457 return PieceType(((m >> 12) & 3) + 2);
460 inline Move make_move(Square from, Square to) {
461 return Move(to | (from << 6));
465 inline Move make(Square from, Square to, PieceType pt = KNIGHT) {
466 return Move(to | (from << 6) | T | ((pt - KNIGHT) << 12)) ;
469 inline bool is_ok(Move m) {
470 return from_sq(m) != to_sq(m); // Catches also MOVE_NULL and MOVE_NONE
475 inline const std::string square_to_string(Square s) {
476 char ch[] = { file_to_char(file_of(s)), rank_to_char(rank_of(s)), 0 };
480 /// Our insertion sort implementation, works with pointers and iterators and is
481 /// guaranteed to be stable, as is needed.
482 template<typename T, typename K>
483 void sort(K first, K last)
488 for (p = first + 1; p < last; p++)
491 for (q = p; q != first && *(q-1) < tmp; --q)
497 #endif // !defined(TYPES_H_INCLUDED)