/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
- Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
- Copyright (C) 2015-2020 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
+ Copyright (C) 2004-2020 The Stockfish developers (see AUTHORS file)
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
#include <cassert>
#include <cctype>
-#include <climits>
#include <cstdint>
#include <cstdlib>
#include <algorithm>
VALUE_MATE_IN_MAX_PLY = VALUE_MATE - MAX_PLY,
VALUE_MATED_IN_MAX_PLY = -VALUE_MATE_IN_MAX_PLY,
- PawnValueMg = 124, PawnValueEg = 206,
+ PawnValueMg = 126, PawnValueEg = 208,
KnightValueMg = 781, KnightValueEg = 854,
BishopValueMg = 825, BishopValueEg = 915,
RookValueMg = 1276, RookValueEg = 1380,
PIECE_NB = 16
};
+// An ID used to track the pieces. Max. 32 pieces on board.
+enum PieceId {
+ PIECE_ID_ZERO = 0,
+ PIECE_ID_KING = 30,
+ PIECE_ID_WKING = 30,
+ PIECE_ID_BKING = 31,
+ PIECE_ID_NONE = 32
+};
+
+inline PieceId operator++(PieceId& d, int) {
+
+ PieceId x = d;
+ d = PieceId(int(d) + 1);
+ return x;
+}
+
constexpr Value PieceValue[PHASE_NB][PIECE_NB] = {
{ VALUE_ZERO, PawnValueMg, KnightValueMg, BishopValueMg, RookValueMg, QueenValueMg, VALUE_ZERO, VALUE_ZERO,
VALUE_ZERO, PawnValueMg, KnightValueMg, BishopValueMg, RookValueMg, QueenValueMg, VALUE_ZERO, VALUE_ZERO },
typedef int Depth;
enum : int {
-
DEPTH_QS_CHECKS = 0,
DEPTH_QS_NO_CHECKS = -1,
DEPTH_QS_RECAPTURES = -5,
SQ_A8, SQ_B8, SQ_C8, SQ_D8, SQ_E8, SQ_F8, SQ_G8, SQ_H8,
SQ_NONE,
- SQUARE_NB = 64
+ SQUARE_ZERO = 0,
+ SQUARE_NB = 64
};
enum Direction : int {
RANK_1, RANK_2, RANK_3, RANK_4, RANK_5, RANK_6, RANK_7, RANK_8, RANK_NB
};
+// unique number for each piece type on each square
+enum PieceSquare : uint32_t {
+ PS_NONE = 0,
+ PS_W_PAWN = 1,
+ PS_B_PAWN = 1 * SQUARE_NB + 1,
+ PS_W_KNIGHT = 2 * SQUARE_NB + 1,
+ PS_B_KNIGHT = 3 * SQUARE_NB + 1,
+ PS_W_BISHOP = 4 * SQUARE_NB + 1,
+ PS_B_BISHOP = 5 * SQUARE_NB + 1,
+ PS_W_ROOK = 6 * SQUARE_NB + 1,
+ PS_B_ROOK = 7 * SQUARE_NB + 1,
+ PS_W_QUEEN = 8 * SQUARE_NB + 1,
+ PS_B_QUEEN = 9 * SQUARE_NB + 1,
+ PS_W_KING = 10 * SQUARE_NB + 1,
+ PS_END = PS_W_KING, // pieces without kings (pawns included)
+ PS_B_KING = 11 * SQUARE_NB + 1,
+ PS_END2 = 12 * SQUARE_NB + 1
+};
+
+struct ExtPieceSquare {
+ PieceSquare from[COLOR_NB];
+};
+
+// Array for finding the PieceSquare corresponding to the piece on the board
+extern ExtPieceSquare kpp_board_index[PIECE_NB];
+
+constexpr bool is_ok(PieceId pid);
+constexpr Square rotate180(Square sq);
+
+// Structure holding which tracked piece (PieceId) is where (PieceSquare)
+class EvalList {
+
+public:
+ // Max. number of pieces without kings is 30 but must be a multiple of 4 in AVX2
+ static const int MAX_LENGTH = 32;
+
+ // Array that holds the piece id for the pieces on the board
+ PieceId piece_id_list[SQUARE_NB];
+
+ // List of pieces, separate from White and Black POV
+ PieceSquare* piece_list_fw() const { return const_cast<PieceSquare*>(pieceListFw); }
+ PieceSquare* piece_list_fb() const { return const_cast<PieceSquare*>(pieceListFb); }
+
+ // Place the piece pc with piece_id on the square sq on the board
+ void put_piece(PieceId piece_id, Square sq, Piece pc)
+ {
+ assert(is_ok(piece_id));
+ if (pc != NO_PIECE)
+ {
+ pieceListFw[piece_id] = PieceSquare(kpp_board_index[pc].from[WHITE] + sq);
+ pieceListFb[piece_id] = PieceSquare(kpp_board_index[pc].from[BLACK] + rotate180(sq));
+ piece_id_list[sq] = piece_id;
+ }
+ else
+ {
+ pieceListFw[piece_id] = PS_NONE;
+ pieceListFb[piece_id] = PS_NONE;
+ piece_id_list[sq] = piece_id;
+ }
+ }
+
+ // Convert the specified piece_id piece to ExtPieceSquare type and return it
+ ExtPieceSquare piece_with_id(PieceId piece_id) const
+ {
+ ExtPieceSquare eps;
+ eps.from[WHITE] = pieceListFw[piece_id];
+ eps.from[BLACK] = pieceListFb[piece_id];
+ return eps;
+ }
+
+private:
+ PieceSquare pieceListFw[MAX_LENGTH];
+ PieceSquare pieceListFb[MAX_LENGTH];
+};
+
+// For differential evaluation of pieces that changed since last turn
+struct DirtyPiece {
+
+ // Number of changed pieces
+ int dirty_num;
+
+ // The ids of changed pieces, max. 2 pieces can change in one move
+ PieceId pieceId[2];
+
+ // What changed from the piece with that piece number
+ ExtPieceSquare old_piece[2];
+ ExtPieceSquare new_piece[2];
+};
/// Score enum stores a middlegame and an endgame value in a single integer (enum).
/// The least significant 16 bits are used to store the middlegame value and the
}
#define ENABLE_BASE_OPERATORS_ON(T) \
-constexpr T operator+(T d1, T d2) { return T(int(d1) + int(d2)); } \
-constexpr T operator-(T d1, T d2) { return T(int(d1) - int(d2)); } \
+constexpr T operator+(T d1, int d2) { return T(int(d1) + d2); } \
+constexpr T operator-(T d1, int d2) { return T(int(d1) - d2); } \
constexpr T operator-(T d) { return T(-int(d)); } \
-inline T& operator+=(T& d1, T d2) { return d1 = d1 + d2; } \
-inline T& operator-=(T& d1, T d2) { return d1 = d1 - d2; }
+inline T& operator+=(T& d1, int d2) { return d1 = d1 + d2; } \
+inline T& operator-=(T& d1, int d2) { return d1 = d1 - d2; }
#define ENABLE_INCR_OPERATORS_ON(T) \
inline T& operator++(T& d) { return d = T(int(d) + 1); } \
ENABLE_FULL_OPERATORS_ON(Value)
ENABLE_FULL_OPERATORS_ON(Direction)
-ENABLE_INCR_OPERATORS_ON(PieceType)
ENABLE_INCR_OPERATORS_ON(Piece)
+ENABLE_INCR_OPERATORS_ON(PieceSquare)
+ENABLE_INCR_OPERATORS_ON(PieceId)
+ENABLE_INCR_OPERATORS_ON(PieceType)
ENABLE_INCR_OPERATORS_ON(Square)
ENABLE_INCR_OPERATORS_ON(File)
ENABLE_INCR_OPERATORS_ON(Rank)
#undef ENABLE_INCR_OPERATORS_ON
#undef ENABLE_BASE_OPERATORS_ON
-/// Additional operators to add integers to a Value
-constexpr Value operator+(Value v, int i) { return Value(int(v) + i); }
-constexpr Value operator-(Value v, int i) { return Value(int(v) - i); }
-inline Value& operator+=(Value& v, int i) { return v = v + i; }
-inline Value& operator-=(Value& v, int i) { return v = v - i; }
-
/// Additional operators to add a Direction to a Square
constexpr Square operator+(Square s, Direction d) { return Square(int(s) + int(d)); }
constexpr Square operator-(Square s, Direction d) { return Square(int(s) - int(d)); }
return Color(c ^ BLACK); // Toggle color
}
-constexpr Square flip_rank(Square s) {
+constexpr Square flip_rank(Square s) { // Swap A1 <-> A8
return Square(s ^ SQ_A8);
}
-constexpr Square flip_file(Square s) {
+constexpr Square flip_file(Square s) { // Swap A1 <-> H1
return Square(s ^ SQ_H1);
}
constexpr Piece operator~(Piece pc) {
- return Piece(pc ^ 8); // Swap color of piece B_KNIGHT -> W_KNIGHT
+ return Piece(pc ^ 8); // Swap color of piece B_KNIGHT <-> W_KNIGHT
}
constexpr CastlingRights operator&(Color c, CastlingRights cr) {
return Color(pc >> 3);
}
+constexpr bool is_ok(PieceId pid) {
+ return pid < PIECE_ID_NONE;
+}
+
constexpr bool is_ok(Square s) {
return s >= SQ_A1 && s <= SQ_H8;
}
return Square(m & 0x3F);
}
+// Return relative square when turning the board 180 degrees
+constexpr Square rotate180(Square sq) {
+ return (Square)(sq ^ 0x3F);
+}
+
constexpr int from_to(Move m) {
return m & 0xFFF;
}
return from_sq(m) != to_sq(m); // Catch MOVE_NULL and MOVE_NONE
}
+/// Based on a congruential pseudo random number generator
+constexpr Key make_key(uint64_t seed) {
+ return seed * 6364136223846793005ULL + 1442695040888963407ULL;
+}
+
#endif // #ifndef TYPES_H_INCLUDED
#include "tune.h" // Global visibility to tuning setup
projects / stockfish / blobdiff