/*
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-2016 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 <algorithm>
#include <cassert>
+#include <cstdlib>
#include <cstring> // For std::memset
#include <iomanip>
#include <sstream>
+#include <iostream>
#include "bitboard.h"
#include "evaluate.h"
#include "material.h"
#include "pawns.h"
+#include "thread.h"
+#include "uci.h"
-namespace {
+namespace Eval {
- namespace Trace {
+ bool useNNUE;
+ std::string eval_file_loaded="None";
- enum Term { // The first 8 entries are for PieceType
- MATERIAL = 8, IMBALANCE, MOBILITY, THREAT, PASSED, SPACE, TOTAL, TERM_NB
- };
+ void init_NNUE() {
- double scores[TERM_NB][COLOR_NB][PHASE_NB];
+ useNNUE = Options["Use NNUE"];
+ std::string eval_file = std::string(Options["EvalFile"]);
+ if (useNNUE && eval_file_loaded != eval_file)
+ if (Eval::NNUE::load_eval_file(eval_file))
+ eval_file_loaded = eval_file;
+ }
- double to_cp(Value v) { return double(v) / PawnValueEg; }
+ void verify_NNUE() {
- void add(int idx, Color c, Score s) {
- scores[idx][c][MG] = to_cp(mg_value(s));
- scores[idx][c][EG] = to_cp(eg_value(s));
+ std::string eval_file = std::string(Options["EvalFile"]);
+ if (useNNUE && eval_file_loaded != eval_file)
+ {
+ UCI::OptionsMap defaults;
+ UCI::init(defaults);
+
+ sync_cout << "info string ERROR: NNUE evaluation used, but the network file " << eval_file << " was not loaded successfully." << sync_endl;
+ sync_cout << "info string ERROR: The UCI option EvalFile might need to specify the full path, including the directory/folder name, to the file." << sync_endl;
+ sync_cout << "info string ERROR: The default net can be downloaded from: https://tests.stockfishchess.org/api/nn/"+std::string(defaults["EvalFile"]) << sync_endl;
+ sync_cout << "info string ERROR: If the UCI option Use NNUE is set to true, network evaluation parameters compatible with the program must be available." << sync_endl;
+ sync_cout << "info string ERROR: The engine will be terminated now." << sync_endl;
+ std::exit(EXIT_FAILURE);
}
- void add(int idx, Score w, Score b = SCORE_ZERO) {
- add(idx, WHITE, w); add(idx, BLACK, b);
- }
+ if (useNNUE)
+ sync_cout << "info string NNUE evaluation using " << eval_file << " enabled." << sync_endl;
+ else
+ sync_cout << "info string classical evaluation enabled." << sync_endl;
+ }
+}
+
+namespace Trace {
- std::ostream& operator<<(std::ostream& os, Term t) {
+ enum Tracing { NO_TRACE, TRACE };
- if (t == MATERIAL || t == IMBALANCE || t == Term(PAWN) || t == TOTAL)
- os << " --- --- | --- --- | ";
- else
- os << std::setw(5) << scores[t][WHITE][MG] << " "
- << std::setw(5) << scores[t][WHITE][EG] << " | "
- << std::setw(5) << scores[t][BLACK][MG] << " "
- << std::setw(5) << scores[t][BLACK][EG] << " | ";
+ enum Term { // The first 8 entries are reserved for PieceType
+ MATERIAL = 8, IMBALANCE, MOBILITY, THREAT, PASSED, SPACE, WINNABLE, TOTAL, TERM_NB
+ };
- os << std::setw(5) << scores[t][WHITE][MG] - scores[t][BLACK][MG] << " "
- << std::setw(5) << scores[t][WHITE][EG] - scores[t][BLACK][EG] << " \n";
+ Score scores[TERM_NB][COLOR_NB];
- return os;
- }
+ double to_cp(Value v) { return double(v) / PawnValueEg; }
+
+ void add(int idx, Color c, Score s) {
+ scores[idx][c] = s;
}
- using namespace Trace;
+ void add(int idx, Score w, Score b = SCORE_ZERO) {
+ scores[idx][WHITE] = w;
+ scores[idx][BLACK] = b;
+ }
- // Struct EvalInfo contains various information computed and collected
- // by the evaluation functions.
- struct EvalInfo {
+ std::ostream& operator<<(std::ostream& os, Score s) {
+ os << std::setw(5) << to_cp(mg_value(s)) << " "
+ << std::setw(5) << to_cp(eg_value(s));
+ return os;
+ }
- // attackedBy[color][piece type] is a bitboard representing all squares
- // attacked by a given color and piece type (can be also ALL_PIECES).
- Bitboard attackedBy[COLOR_NB][PIECE_TYPE_NB];
+ std::ostream& operator<<(std::ostream& os, Term t) {
- // attackedBy2[color] are the squares attacked by 2 pieces of a given color,
- // possibly via x-ray or by one pawn and one piece. Diagonal x-ray through
- // pawn or squares attacked by 2 pawns are not explicitly added.
- Bitboard attackedBy2[COLOR_NB];
+ if (t == MATERIAL || t == IMBALANCE || t == WINNABLE || t == TOTAL)
+ os << " ---- ----" << " | " << " ---- ----";
+ else
+ os << scores[t][WHITE] << " | " << scores[t][BLACK];
- // kingRing[color] is the zone around the king which is considered
- // by the king safety evaluation. This consists of the squares directly
- // adjacent to the king, and the three (or two, for a king on an edge file)
- // squares two ranks in front of the king. For instance, if black's king
- // is on g8, kingRing[BLACK] is a bitboard containing the squares f8, h8,
- // f7, g7, h7, f6, g6 and h6.
- Bitboard kingRing[COLOR_NB];
+ os << " | " << scores[t][WHITE] - scores[t][BLACK] << "\n";
+ return os;
+ }
+}
- // kingAttackersCount[color] is the number of pieces of the given color
- // which attack a square in the kingRing of the enemy king.
- int kingAttackersCount[COLOR_NB];
+using namespace Trace;
- // kingAttackersWeight[color] is the sum of the "weights" of the pieces of the
- // given color which attack a square in the kingRing of the enemy king. The
- // weights of the individual piece types are given by the elements in the
- // KingAttackWeights array.
- int kingAttackersWeight[COLOR_NB];
+namespace {
- // kingAdjacentZoneAttacksCount[color] is the number of attacks by the given
- // color to squares directly adjacent to the enemy king. Pieces which attack
- // more than one square are counted multiple times. For instance, if there is
- // a white knight on g5 and black's king is on g8, this white knight adds 2
- // to kingAdjacentZoneAttacksCount[WHITE].
- int kingAdjacentZoneAttacksCount[COLOR_NB];
+ // Threshold for lazy and space evaluation
+ constexpr Value LazyThreshold1 = Value(1400);
+ constexpr Value LazyThreshold2 = Value(1300);
+ constexpr Value SpaceThreshold = Value(12222);
+ constexpr Value NNUEThreshold1 = Value(550);
+ constexpr Value NNUEThreshold2 = Value(150);
- Bitboard pinnedPieces[COLOR_NB];
- Material::Entry* me;
- Pawns::Entry* pi;
+ // KingAttackWeights[PieceType] contains king attack weights by piece type
+ constexpr int KingAttackWeights[PIECE_TYPE_NB] = { 0, 0, 81, 52, 44, 10 };
+
+ // SafeCheck[PieceType][single/multiple] contains safe check bonus by piece type,
+ // higher if multiple safe checks are possible for that piece type.
+ constexpr int SafeCheck[][2] = {
+ {}, {}, {792, 1283}, {645, 967}, {1084, 1897}, {772, 1119}
};
- #define V(v) Value(v)
- #define S(mg, eg) make_score(mg, eg)
-
- // MobilityBonus[PieceType][attacked] contains bonuses for middle and end
- // game, indexed by piece type and number of attacked squares in the MobilityArea.
- const Score MobilityBonus[][32] = {
- {}, {},
- { S(-75,-76), S(-56,-54), S(- 9,-26), S( -2,-10), S( 6, 5), S( 15, 11), // Knights
- S( 22, 26), S( 30, 28), S( 36, 29) },
- { S(-48,-58), S(-21,-19), S( 16, -2), S( 26, 12), S( 37, 22), S( 51, 42), // Bishops
- S( 54, 54), S( 63, 58), S( 65, 63), S( 71, 70), S( 79, 74), S( 81, 86),
- S( 92, 90), S( 97, 94) },
- { S(-56,-78), S(-25,-18), S(-11, 26), S( -5, 55), S( -4, 70), S( -1, 81), // Rooks
- S( 8,109), S( 14,120), S( 21,128), S( 23,143), S( 31,154), S( 32,160),
- S( 43,165), S( 49,168), S( 59,169) },
- { S(-40,-35), S(-25,-12), S( 2, 7), S( 4, 19), S( 14, 37), S( 24, 55), // Queens
- S( 25, 62), S( 40, 76), S( 43, 79), S( 47, 87), S( 54, 94), S( 56,102),
- S( 60,111), S( 70,116), S( 72,118), S( 73,122), S( 75,128), S( 77,130),
- S( 85,133), S( 94,136), S( 99,140), S(108,157), S(112,158), S(113,161),
- S(118,174), S(119,177), S(123,191), S(128,199) }
+#define S(mg, eg) make_score(mg, eg)
+
+ // MobilityBonus[PieceType-2][attacked] contains bonuses for middle and end game,
+ // indexed by piece type and number of attacked squares in the mobility area.
+ constexpr Score MobilityBonus[][32] = {
+ { S(-62,-81), S(-53,-56), S(-12,-31), S( -4,-16), S( 3, 5), S( 13, 11), // Knight
+ S( 22, 17), S( 28, 20), S( 33, 25) },
+ { S(-48,-59), S(-20,-23), S( 16, -3), S( 26, 13), S( 38, 24), S( 51, 42), // Bishop
+ S( 55, 54), S( 63, 57), S( 63, 65), S( 68, 73), S( 81, 78), S( 81, 86),
+ S( 91, 88), S( 98, 97) },
+ { S(-60,-78), S(-20,-17), S( 2, 23), S( 3, 39), S( 3, 70), S( 11, 99), // Rook
+ S( 22,103), S( 31,121), S( 40,134), S( 40,139), S( 41,158), S( 48,164),
+ S( 57,168), S( 57,169), S( 62,172) },
+ { S(-30,-48), S(-12,-30), S( -8, -7), S( -9, 19), S( 20, 40), S( 23, 55), // Queen
+ S( 23, 59), S( 35, 75), S( 38, 78), S( 53, 96), S( 64, 96), S( 65,100),
+ S( 65,121), S( 66,127), S( 67,131), S( 67,133), S( 72,136), S( 72,141),
+ S( 77,147), S( 79,150), S( 93,151), S(108,168), S(108,168), S(108,171),
+ S(110,182), S(114,182), S(114,192), S(116,219) }
};
- // Outpost[knight/bishop][supported by pawn] contains bonuses for knights and
- // bishops outposts, bigger if outpost piece is supported by a pawn.
- const Score Outpost[][2] = {
- { S(43,11), S(65,20) }, // Knights
- { S(20, 3), S(29, 8) } // Bishops
+ // KingProtector[knight/bishop] contains penalty for each distance unit to own king
+ constexpr Score KingProtector[] = { S(8, 9), S(6, 9) };
+
+ // Outpost[knight/bishop] contains bonuses for each knight or bishop occupying a
+ // pawn protected square on rank 4 to 6 which is also safe from a pawn attack.
+ constexpr Score Outpost[] = { S(56, 36), S(30, 23) };
+
+ // PassedRank[Rank] contains a bonus according to the rank of a passed pawn
+ constexpr Score PassedRank[RANK_NB] = {
+ S(0, 0), S(10, 28), S(17, 33), S(15, 41), S(62, 72), S(168, 177), S(276, 260)
};
- // ReachableOutpost[knight/bishop][supported by pawn] contains bonuses for
- // knights and bishops which can reach an outpost square in one move, bigger
- // if outpost square is supported by a pawn.
- const Score ReachableOutpost[][2] = {
- { S(21, 5), S(35, 8) }, // Knights
- { S( 8, 0), S(14, 4) } // Bishops
+ // RookOnFile[semiopen/open] contains bonuses for each rook when there is
+ // no (friendly) pawn on the rook file.
+ constexpr Score RookOnFile[] = { S(19, 7), S(48, 29) };
+
+ // ThreatByMinor/ByRook[attacked PieceType] contains bonuses according to
+ // which piece type attacks which one. Attacks on lesser pieces which are
+ // pawn-defended are not considered.
+ constexpr Score ThreatByMinor[PIECE_TYPE_NB] = {
+ S(0, 0), S(5, 32), S(57, 41), S(77, 56), S(88, 119), S(79, 161)
};
- // RookOnFile[semiopen/open] contains bonuses for each rook when there is no
- // friendly pawn on the rook file.
- const Score RookOnFile[2] = { S(20, 7), S(45, 20) };
-
- // ThreatBySafePawn[PieceType] contains bonuses according to which piece
- // type is attacked by a pawn which is protected or is not attacked.
- const Score ThreatBySafePawn[PIECE_TYPE_NB] = {
- S(0, 0), S(0, 0), S(176, 139), S(131, 127), S(217, 218), S(203, 215) };
-
- // Threat[by minor/by rook][attacked PieceType] contains
- // bonuses according to which piece type attacks which one.
- // Attacks on lesser pieces which are pawn-defended are not considered.
- const Score Threat[][PIECE_TYPE_NB] = {
- { S(0, 0), S(0, 33), S(45, 43), S(46, 47), S(72,107), S(48,118) }, // by Minor
- { S(0, 0), S(0, 25), S(40, 62), S(40, 59), S( 0, 34), S(35, 48) } // by Rook
+ constexpr Score ThreatByRook[PIECE_TYPE_NB] = {
+ S(0, 0), S(3, 46), S(37, 68), S(42, 60), S(0, 38), S(58, 41)
};
- // ThreatByKing[on one/on many] contains bonuses for King attacks on
- // pawns or pieces which are not pawn-defended.
- const Score ThreatByKing[2] = { S(3, 62), S(9, 138) };
+ // Assorted bonuses and penalties
+ constexpr Score BadOutpost = S( -7, 36);
+ constexpr Score BishopOnKingRing = S( 24, 0);
+ constexpr Score BishopPawns = S( 3, 7);
+ constexpr Score BishopXRayPawns = S( 4, 5);
+ constexpr Score CorneredBishop = S( 50, 50);
+ constexpr Score FlankAttacks = S( 8, 0);
+ constexpr Score Hanging = S( 69, 36);
+ constexpr Score KnightOnQueen = S( 16, 11);
+ constexpr Score LongDiagonalBishop = S( 45, 0);
+ constexpr Score MinorBehindPawn = S( 18, 3);
+ constexpr Score PassedFile = S( 11, 8);
+ constexpr Score PawnlessFlank = S( 17, 95);
+ constexpr Score ReachableOutpost = S( 31, 22);
+ constexpr Score RestrictedPiece = S( 7, 7);
+ constexpr Score RookOnKingRing = S( 16, 0);
+ constexpr Score RookOnQueenFile = S( 6, 11);
+ constexpr Score SliderOnQueen = S( 60, 18);
+ constexpr Score ThreatByKing = S( 24, 89);
+ constexpr Score ThreatByPawnPush = S( 48, 39);
+ constexpr Score ThreatBySafePawn = S(173, 94);
+ constexpr Score TrappedRook = S( 55, 13);
+ constexpr Score WeakQueenProtection = S( 14, 0);
+ constexpr Score WeakQueen = S( 56, 15);
+
+
+#undef S
+
+ // Evaluation class computes and stores attacks tables and other working data
+ template<Tracing T>
+ class Evaluation {
+
+ public:
+ Evaluation() = delete;
+ explicit Evaluation(const Position& p) : pos(p) {}
+ Evaluation& operator=(const Evaluation&) = delete;
+ Value value();
+
+ private:
+ template<Color Us> void initialize();
+ template<Color Us, PieceType Pt> Score pieces();
+ template<Color Us> Score king() const;
+ template<Color Us> Score threats() const;
+ template<Color Us> Score passed() const;
+ template<Color Us> Score space() const;
+ Value winnable(Score score) const;
+
+ const Position& pos;
+ Material::Entry* me;
+ Pawns::Entry* pe;
+ Bitboard mobilityArea[COLOR_NB];
+ Score mobility[COLOR_NB] = { SCORE_ZERO, SCORE_ZERO };
- // Passed[mg/eg][Rank] contains midgame and endgame bonuses for passed pawns.
- // We don't use a Score because we process the two components independently.
- const Value Passed[][RANK_NB] = {
- { V(5), V( 5), V(31), V(73), V(166), V(252) },
- { V(7), V(14), V(38), V(73), V(166), V(252) }
- };
+ // attackedBy[color][piece type] is a bitboard representing all squares
+ // attacked by a given color and piece type. Special "piece types" which
+ // is also calculated is ALL_PIECES.
+ Bitboard attackedBy[COLOR_NB][PIECE_TYPE_NB];
+
+ // attackedBy2[color] are the squares attacked by at least 2 units of a given
+ // color, including x-rays. But diagonal x-rays through pawns are not computed.
+ Bitboard attackedBy2[COLOR_NB];
+
+ // kingRing[color] are the squares adjacent to the king plus some other
+ // very near squares, depending on king position.
+ Bitboard kingRing[COLOR_NB];
+
+ // kingAttackersCount[color] is the number of pieces of the given color
+ // which attack a square in the kingRing of the enemy king.
+ int kingAttackersCount[COLOR_NB];
- // PassedFile[File] contains a bonus according to the file of a passed pawn
- const Score PassedFile[FILE_NB] = {
- S( 9, 10), S( 2, 10), S( 1, -8), S(-20,-12),
- S(-20,-12), S( 1, -8), S( 2, 10), S( 9, 10)
+ // kingAttackersWeight[color] is the sum of the "weights" of the pieces of
+ // the given color which attack a square in the kingRing of the enemy king.
+ // The weights of the individual piece types are given by the elements in
+ // the KingAttackWeights array.
+ int kingAttackersWeight[COLOR_NB];
+
+ // kingAttacksCount[color] is the number of attacks by the given color to
+ // squares directly adjacent to the enemy king. Pieces which attack more
+ // than one square are counted multiple times. For instance, if there is
+ // a white knight on g5 and black's king is on g8, this white knight adds 2
+ // to kingAttacksCount[WHITE].
+ int kingAttacksCount[COLOR_NB];
};
- // Assorted bonuses and penalties used by evaluation
- const Score MinorBehindPawn = S(16, 0);
- const Score BishopPawns = S( 8, 12);
- const Score RookOnPawn = S( 8, 24);
- const Score TrappedRook = S(92, 0);
- const Score SafeCheck = S(20, 20);
- const Score OtherCheck = S(10, 10);
- const Score ThreatByHangingPawn = S(71, 61);
- const Score LooseEnemies = S( 0, 25);
- const Score WeakQueen = S(35, 0);
- const Score Hanging = S(48, 27);
- const Score ThreatByPawnPush = S(38, 22);
- const Score Unstoppable = S( 0, 20);
-
- // Penalty for a bishop on a1/h1 (a8/h8 for black) which is trapped by
- // a friendly pawn on b2/g2 (b7/g7 for black). This can obviously only
- // happen in Chess960 games.
- const Score TrappedBishopA1H1 = S(50, 50);
-
- #undef S
- #undef V
-
- // King danger constants and variables. The king danger scores are looked-up
- // in KingDanger[]. Various little "meta-bonuses" measuring the strength
- // of the enemy attack are added up into an integer, which is used as an
- // index to KingDanger[].
- Score KingDanger[512];
- // KingAttackWeights[PieceType] contains king attack weights by piece type
- const int KingAttackWeights[PIECE_TYPE_NB] = { 0, 0, 7, 5, 4, 1 };
+ // Evaluation::initialize() computes king and pawn attacks, and the king ring
+ // bitboard for a given color. This is done at the beginning of the evaluation.
- // Penalties for enemy's safe checks
- const int QueenContactCheck = 89;
- const int QueenCheck = 62;
- const int RookCheck = 57;
- const int BishopCheck = 48;
- const int KnightCheck = 78;
+ template<Tracing T> template<Color Us>
+ void Evaluation<T>::initialize() {
+ constexpr Color Them = ~Us;
+ constexpr Direction Up = pawn_push(Us);
+ constexpr Direction Down = -Up;
+ constexpr Bitboard LowRanks = (Us == WHITE ? Rank2BB | Rank3BB : Rank7BB | Rank6BB);
- // eval_init() initializes king and attack bitboards for a given color
- // adding pawn attacks. To be done at the beginning of the evaluation.
+ const Square ksq = pos.square<KING>(Us);
- template<Color Us>
- void eval_init(const Position& pos, EvalInfo& ei) {
+ Bitboard dblAttackByPawn = pawn_double_attacks_bb<Us>(pos.pieces(Us, PAWN));
- const Color Them = (Us == WHITE ? BLACK : WHITE);
- const Square Down = (Us == WHITE ? DELTA_S : DELTA_N);
+ // Find our pawns that are blocked or on the first two ranks
+ Bitboard b = pos.pieces(Us, PAWN) & (shift<Down>(pos.pieces()) | LowRanks);
- ei.pinnedPieces[Us] = pos.pinned_pieces(Us);
- Bitboard b = ei.attackedBy[Them][KING];
- ei.attackedBy[Them][ALL_PIECES] |= b;
- ei.attackedBy[Us][ALL_PIECES] |= ei.attackedBy[Us][PAWN] = ei.pi->pawn_attacks(Us);
- ei.attackedBy2[Us] = ei.attackedBy[Us][PAWN] & ei.attackedBy[Us][KING];
+ // Squares occupied by those pawns, by our king or queen, by blockers to attacks on our king
+ // or controlled by enemy pawns are excluded from the mobility area.
+ mobilityArea[Us] = ~(b | pos.pieces(Us, KING, QUEEN) | pos.blockers_for_king(Us) | pe->pawn_attacks(Them));
- // Init king safety tables only if we are going to use them
- if (pos.non_pawn_material(Us) >= QueenValueMg)
- {
- ei.kingRing[Them] = b | shift_bb<Down>(b);
- b &= ei.attackedBy[Us][PAWN];
- ei.kingAttackersCount[Us] = popcount(b);
- ei.kingAdjacentZoneAttacksCount[Us] = ei.kingAttackersWeight[Us] = 0;
- }
- else
- ei.kingRing[Them] = ei.kingAttackersCount[Us] = 0;
+ // Initialize attackedBy[] for king and pawns
+ attackedBy[Us][KING] = attacks_bb<KING>(ksq);
+ attackedBy[Us][PAWN] = pe->pawn_attacks(Us);
+ attackedBy[Us][ALL_PIECES] = attackedBy[Us][KING] | attackedBy[Us][PAWN];
+ attackedBy2[Us] = dblAttackByPawn | (attackedBy[Us][KING] & attackedBy[Us][PAWN]);
+
+ // Init our king safety tables
+ Square s = make_square(std::clamp(file_of(ksq), FILE_B, FILE_G),
+ std::clamp(rank_of(ksq), RANK_2, RANK_7));
+ kingRing[Us] = attacks_bb<KING>(s) | s;
+
+ kingAttackersCount[Them] = popcount(kingRing[Us] & pe->pawn_attacks(Them));
+ kingAttacksCount[Them] = kingAttackersWeight[Them] = 0;
+
+ // Remove from kingRing[] the squares defended by two pawns
+ kingRing[Us] &= ~dblAttackByPawn;
}
- // evaluate_pieces() assigns bonuses and penalties to the pieces of a given
- // color and type.
+ // Evaluation::pieces() scores pieces of a given color and type
- template<bool DoTrace, Color Us = WHITE, PieceType Pt = KNIGHT>
- Score evaluate_pieces(const Position& pos, EvalInfo& ei, Score* mobility,
- const Bitboard* mobilityArea) {
- Bitboard b, bb;
- Square s;
- Score score = SCORE_ZERO;
+ template<Tracing T> template<Color Us, PieceType Pt>
+ Score Evaluation<T>::pieces() {
- const PieceType NextPt = (Us == WHITE ? Pt : PieceType(Pt + 1));
- const Color Them = (Us == WHITE ? BLACK : WHITE);
- const Bitboard OutpostRanks = (Us == WHITE ? Rank4BB | Rank5BB | Rank6BB
- : Rank5BB | Rank4BB | Rank3BB);
+ constexpr Color Them = ~Us;
+ constexpr Direction Down = -pawn_push(Us);
+ constexpr Bitboard OutpostRanks = (Us == WHITE ? Rank4BB | Rank5BB | Rank6BB
+ : Rank5BB | Rank4BB | Rank3BB);
const Square* pl = pos.squares<Pt>(Us);
- ei.attackedBy[Us][Pt] = 0;
+ Bitboard b, bb;
+ Score score = SCORE_ZERO;
+
+ attackedBy[Us][Pt] = 0;
- while ((s = *pl++) != SQ_NONE)
+ for (Square s = *pl; s != SQ_NONE; s = *++pl)
{
// Find attacked squares, including x-ray attacks for bishops and rooks
- b = Pt == BISHOP ? attacks_bb<BISHOP>(s, pos.pieces() ^ pos.pieces(Us, QUEEN))
- : Pt == ROOK ? attacks_bb< ROOK>(s, pos.pieces() ^ pos.pieces(Us, ROOK, QUEEN))
- : pos.attacks_from<Pt>(s);
+ b = Pt == BISHOP ? attacks_bb<BISHOP>(s, pos.pieces() ^ pos.pieces(QUEEN))
+ : Pt == ROOK ? attacks_bb< ROOK>(s, pos.pieces() ^ pos.pieces(QUEEN) ^ pos.pieces(Us, ROOK))
+ : attacks_bb<Pt>(s, pos.pieces());
- if (ei.pinnedPieces[Us] & s)
- b &= LineBB[pos.square<KING>(Us)][s];
+ if (pos.blockers_for_king(Us) & s)
+ b &= line_bb(pos.square<KING>(Us), s);
- ei.attackedBy2[Us] |= ei.attackedBy[Us][ALL_PIECES] & b;
- ei.attackedBy[Us][ALL_PIECES] |= ei.attackedBy[Us][Pt] |= b;
+ attackedBy2[Us] |= attackedBy[Us][ALL_PIECES] & b;
+ attackedBy[Us][Pt] |= b;
+ attackedBy[Us][ALL_PIECES] |= b;
- if (b & ei.kingRing[Them])
+ if (b & kingRing[Them])
{
- ei.kingAttackersCount[Us]++;
- ei.kingAttackersWeight[Us] += KingAttackWeights[Pt];
- ei.kingAdjacentZoneAttacksCount[Us] += popcount(b & ei.attackedBy[Them][KING]);
+ kingAttackersCount[Us]++;
+ kingAttackersWeight[Us] += KingAttackWeights[Pt];
+ kingAttacksCount[Us] += popcount(b & attackedBy[Them][KING]);
}
- if (Pt == QUEEN)
- b &= ~( ei.attackedBy[Them][KNIGHT]
- | ei.attackedBy[Them][BISHOP]
- | ei.attackedBy[Them][ROOK]);
+ else if (Pt == ROOK && (file_bb(s) & kingRing[Them]))
+ score += RookOnKingRing;
+
+ else if (Pt == BISHOP && (attacks_bb<BISHOP>(s, pos.pieces(PAWN)) & kingRing[Them]))
+ score += BishopOnKingRing;
int mob = popcount(b & mobilityArea[Us]);
- mobility[Us] += MobilityBonus[Pt][mob];
+ mobility[Us] += MobilityBonus[Pt - 2][mob];
if (Pt == BISHOP || Pt == KNIGHT)
{
- // Bonus for outpost squares
- bb = OutpostRanks & ~ei.pi->pawn_attacks_span(Them);
- if (bb & s)
- score += Outpost[Pt == BISHOP][!!(ei.attackedBy[Us][PAWN] & s)];
- else
- {
- bb &= b & ~pos.pieces(Us);
- if (bb)
- score += ReachableOutpost[Pt == BISHOP][!!(ei.attackedBy[Us][PAWN] & bb)];
- }
-
- // Bonus when behind a pawn
- if ( relative_rank(Us, s) < RANK_5
- && (pos.pieces(PAWN) & (s + pawn_push(Us))))
+ // Bonus if the piece is on an outpost square or can reach one
+ // Reduced bonus for knights (BadOutpost) if few relevant targets
+ bb = OutpostRanks & (attackedBy[Us][PAWN] | shift<Down>(pos.pieces(PAWN)))
+ & ~pe->pawn_attacks_span(Them);
+ Bitboard targets = pos.pieces(Them) & ~pos.pieces(PAWN);
+
+ if ( Pt == KNIGHT
+ && bb & s & ~CenterFiles // on a side outpost
+ && !(b & targets) // no relevant attacks
+ && (!more_than_one(targets & (s & QueenSide ? QueenSide : KingSide))))
+ score += BadOutpost;
+ else if (bb & s)
+ score += Outpost[Pt == BISHOP];
+ else if (Pt == KNIGHT && bb & b & ~pos.pieces(Us))
+ score += ReachableOutpost;
+
+ // Bonus for a knight or bishop shielded by pawn
+ if (shift<Down>(pos.pieces(PAWN)) & s)
score += MinorBehindPawn;
- // Penalty for pawns on the same color square as the bishop
+ // Penalty if the piece is far from the king
+ score -= KingProtector[Pt == BISHOP] * distance(pos.square<KING>(Us), s);
+
if (Pt == BISHOP)
- score -= BishopPawns * ei.pi->pawns_on_same_color_squares(Us, s);
-
- // An important Chess960 pattern: A cornered bishop blocked by a friendly
- // pawn diagonally in front of it is a very serious problem, especially
- // when that pawn is also blocked.
- if ( Pt == BISHOP
- && pos.is_chess960()
- && (s == relative_square(Us, SQ_A1) || s == relative_square(Us, SQ_H1)))
{
- Square d = pawn_push(Us) + (file_of(s) == FILE_A ? DELTA_E : DELTA_W);
- if (pos.piece_on(s + d) == make_piece(Us, PAWN))
- score -= !pos.empty(s + d + pawn_push(Us)) ? TrappedBishopA1H1 * 4
- : pos.piece_on(s + d + d) == make_piece(Us, PAWN) ? TrappedBishopA1H1 * 2
- : TrappedBishopA1H1;
+ // Penalty according to the number of our pawns on the same color square as the
+ // bishop, bigger when the center files are blocked with pawns and smaller
+ // when the bishop is outside the pawn chain.
+ Bitboard blocked = pos.pieces(Us, PAWN) & shift<Down>(pos.pieces());
+
+ score -= BishopPawns * pos.pawns_on_same_color_squares(Us, s)
+ * (!(attackedBy[Us][PAWN] & s) + popcount(blocked & CenterFiles));
+
+ // Penalty for all enemy pawns x-rayed
+ score -= BishopXRayPawns * popcount(attacks_bb<BISHOP>(s) & pos.pieces(Them, PAWN));
+
+ // Bonus for bishop on a long diagonal which can "see" both center squares
+ if (more_than_one(attacks_bb<BISHOP>(s, pos.pieces(PAWN)) & Center))
+ score += LongDiagonalBishop;
+
+ // An important Chess960 pattern: a cornered bishop blocked by a friendly
+ // pawn diagonally in front of it is a very serious problem, especially
+ // when that pawn is also blocked.
+ if ( pos.is_chess960()
+ && (s == relative_square(Us, SQ_A1) || s == relative_square(Us, SQ_H1)))
+ {
+ Direction d = pawn_push(Us) + (file_of(s) == FILE_A ? EAST : WEST);
+ if (pos.piece_on(s + d) == make_piece(Us, PAWN))
+ score -= !pos.empty(s + d + pawn_push(Us)) ? CorneredBishop * 4
+ : pos.piece_on(s + d + d) == make_piece(Us, PAWN) ? CorneredBishop * 2
+ : CorneredBishop;
+ }
}
}
if (Pt == ROOK)
{
- // Bonus for aligning with enemy pawns on the same rank/file
- if (relative_rank(Us, s) >= RANK_5)
- score += RookOnPawn * popcount(pos.pieces(Them, PAWN) & PseudoAttacks[ROOK][s]);
+ // Bonus for rook on the same file as a queen
+ if (file_bb(s) & pos.pieces(QUEEN))
+ score += RookOnQueenFile;
- // Bonus when on an open or semi-open file
- if (ei.pi->semiopen_file(Us, file_of(s)))
- score += RookOnFile[!!ei.pi->semiopen_file(Them, file_of(s))];
+ // Bonus for rook on an open or semi-open file
+ if (pos.is_on_semiopen_file(Us, s))
+ score += RookOnFile[pos.is_on_semiopen_file(Them, s)];
- // Penalize when trapped by the king, even more if the king cannot castle
+ // Penalty when trapped by the king, even more if the king cannot castle
else if (mob <= 3)
{
- Square ksq = pos.square<KING>(Us);
-
- if ( ((file_of(ksq) < FILE_E) == (file_of(s) < file_of(ksq)))
- && (rank_of(ksq) == rank_of(s) || relative_rank(Us, ksq) == RANK_1)
- && !ei.pi->semiopen_side(Us, file_of(ksq), file_of(s) < file_of(ksq)))
- score -= (TrappedRook - make_score(mob * 22, 0)) * (1 + !pos.can_castle(Us));
+ File kf = file_of(pos.square<KING>(Us));
+ if ((kf < FILE_E) == (file_of(s) < kf))
+ score -= TrappedRook * (1 + !pos.castling_rights(Us));
}
}
if (Pt == QUEEN)
{
// Penalty if any relative pin or discovered attack against the queen
- if (pos.slider_blockers(pos.pieces(), pos.pieces(Them, ROOK, BISHOP), s))
+ Bitboard queenPinners;
+ if (pos.slider_blockers(pos.pieces(Them, ROOK, BISHOP), s, queenPinners))
score -= WeakQueen;
}
}
-
- if (DoTrace)
+ if (T)
Trace::add(Pt, Us, score);
- // Recursively call evaluate_pieces() of next piece type until KING is excluded
- return score - evaluate_pieces<DoTrace, Them, NextPt>(pos, ei, mobility, mobilityArea);
+ return score;
}
- template<>
- Score evaluate_pieces<false, WHITE, KING>(const Position&, EvalInfo&, Score*, const Bitboard*) { return SCORE_ZERO; }
- template<>
- Score evaluate_pieces< true, WHITE, KING>(const Position&, EvalInfo&, Score*, const Bitboard*) { return SCORE_ZERO; }
-
- // evaluate_king() assigns bonuses and penalties to a king of a given color
+ // Evaluation::king() assigns bonuses and penalties to a king of a given color
- template<Color Us, bool DoTrace>
- Score evaluate_king(const Position& pos, const EvalInfo& ei) {
+ template<Tracing T> template<Color Us>
+ Score Evaluation<T>::king() const {
- const Color Them = (Us == WHITE ? BLACK : WHITE);
- const Square Up = (Us == WHITE ? DELTA_N : DELTA_S);
+ constexpr Color Them = ~Us;
+ constexpr Bitboard Camp = (Us == WHITE ? AllSquares ^ Rank6BB ^ Rank7BB ^ Rank8BB
+ : AllSquares ^ Rank1BB ^ Rank2BB ^ Rank3BB);
- Bitboard undefended, b, b1, b2, safe, other;
- int attackUnits;
+ Bitboard weak, b1, b2, b3, safe, unsafeChecks = 0;
+ Bitboard rookChecks, queenChecks, bishopChecks, knightChecks;
+ int kingDanger = 0;
const Square ksq = pos.square<KING>(Us);
- // King shelter and enemy pawns storm
- Score score = ei.pi->king_safety<Us>(pos, ksq);
+ // Init the score with king shelter and enemy pawns storm
+ Score score = pe->king_safety<Us>(pos);
- // Main king safety evaluation
- if (ei.kingAttackersCount[Them])
- {
- // Find the attacked squares which are defended only by the king...
- undefended = ei.attackedBy[Them][ALL_PIECES]
- & ei.attackedBy[Us][KING]
- & ~ei.attackedBy2[Us];
-
- // ... and those which are not defended at all in the larger king ring
- b = ei.attackedBy[Them][ALL_PIECES] & ~ei.attackedBy[Us][ALL_PIECES]
- & ei.kingRing[Us] & ~pos.pieces(Them);
-
- // Initialize the 'attackUnits' variable, which is used later on as an
- // index into the KingDanger[] array. The initial value is based on the
- // number and types of the enemy's attacking pieces, the number of
- // attacked and undefended squares around our king and the quality of
- // the pawn shelter (current 'score' value).
- attackUnits = std::min(72, ei.kingAttackersCount[Them] * ei.kingAttackersWeight[Them])
- + 9 * ei.kingAdjacentZoneAttacksCount[Them]
- + 21 * popcount(undefended)
- + 12 * (popcount(b) + !!ei.pinnedPieces[Us])
- - 64 * !pos.count<QUEEN>(Them)
- - mg_value(score) / 8;
-
- // Analyse the enemy's safe queen contact checks. Firstly, find the
- // undefended squares around the king reachable by the enemy queen...
- b = undefended & ei.attackedBy[Them][QUEEN] & ~pos.pieces(Them);
-
- // ...and keep squares supported by another enemy piece
- attackUnits += QueenContactCheck * popcount(b & ei.attackedBy2[Them]);
-
- // Analyse the safe enemy's checks which are possible on next move...
- safe = ~(ei.attackedBy[Us][ALL_PIECES] | pos.pieces(Them));
-
- // ... and some other potential checks, only requiring the square to be
- // safe from pawn-attacks, and not being occupied by a blocked pawn.
- other = ~( ei.attackedBy[Us][PAWN]
- | (pos.pieces(Them, PAWN) & shift_bb<Up>(pos.pieces(PAWN))));
-
- b1 = pos.attacks_from<ROOK >(ksq);
- b2 = pos.attacks_from<BISHOP>(ksq);
-
- // Enemy queen safe checks
- if ((b1 | b2) & ei.attackedBy[Them][QUEEN] & safe)
- attackUnits += QueenCheck, score -= SafeCheck;
-
- // For other pieces, also consider the square safe if attacked twice,
- // and only defended by a queen.
- safe |= ei.attackedBy2[Them]
- & ~(ei.attackedBy2[Us] | pos.pieces(Them))
- & ei.attackedBy[Us][QUEEN];
-
- // Enemy rooks safe and other checks
- if (b1 & ei.attackedBy[Them][ROOK] & safe)
- attackUnits += RookCheck, score -= SafeCheck;
-
- else if (b1 & ei.attackedBy[Them][ROOK] & other)
- score -= OtherCheck;
-
- // Enemy bishops safe and other checks
- if (b2 & ei.attackedBy[Them][BISHOP] & safe)
- attackUnits += BishopCheck, score -= SafeCheck;
-
- else if (b2 & ei.attackedBy[Them][BISHOP] & other)
- score -= OtherCheck;
-
- // Enemy knights safe and other checks
- b = pos.attacks_from<KNIGHT>(ksq) & ei.attackedBy[Them][KNIGHT];
- if (b & safe)
- attackUnits += KnightCheck, score -= SafeCheck;
-
- else if (b & other)
- score -= OtherCheck;
-
- // Finally, extract the king danger score from the KingDanger[]
- // array and subtract the score from the evaluation.
- score -= KingDanger[std::max(std::min(attackUnits, 399), 0)];
- }
+ // Attacked squares defended at most once by our queen or king
+ weak = attackedBy[Them][ALL_PIECES]
+ & ~attackedBy2[Us]
+ & (~attackedBy[Us][ALL_PIECES] | attackedBy[Us][KING] | attackedBy[Us][QUEEN]);
- if (DoTrace)
- Trace::add(KING, Us, score);
+ // Analyse the safe enemy's checks which are possible on next move
+ safe = ~pos.pieces(Them);
+ safe &= ~attackedBy[Us][ALL_PIECES] | (weak & attackedBy2[Them]);
- return score;
- }
+ b1 = attacks_bb<ROOK >(ksq, pos.pieces() ^ pos.pieces(Us, QUEEN));
+ b2 = attacks_bb<BISHOP>(ksq, pos.pieces() ^ pos.pieces(Us, QUEEN));
+ // Enemy rooks checks
+ rookChecks = b1 & attackedBy[Them][ROOK] & safe;
+ if (rookChecks)
+ kingDanger += SafeCheck[ROOK][more_than_one(rookChecks)];
+ else
+ unsafeChecks |= b1 & attackedBy[Them][ROOK];
+
+ // Enemy queen safe checks: count them only if the checks are from squares from
+ // which opponent cannot give a rook check, because rook checks are more valuable.
+ queenChecks = (b1 | b2) & attackedBy[Them][QUEEN] & safe
+ & ~(attackedBy[Us][QUEEN] | rookChecks);
+ if (queenChecks)
+ kingDanger += SafeCheck[QUEEN][more_than_one(queenChecks)];
+
+ // Enemy bishops checks: count them only if they are from squares from which
+ // opponent cannot give a queen check, because queen checks are more valuable.
+ bishopChecks = b2 & attackedBy[Them][BISHOP] & safe
+ & ~queenChecks;
+ if (bishopChecks)
+ kingDanger += SafeCheck[BISHOP][more_than_one(bishopChecks)];
- // evaluate_threats() assigns bonuses according to the types of the attacking
- // and the attacked pieces.
-
- const Bitboard WhiteCamp = Rank4BB | Rank5BB | Rank6BB | Rank7BB | Rank8BB;
- const Bitboard BlackCamp = Rank5BB | Rank4BB | Rank3BB | Rank2BB | Rank1BB;
- const Bitboard QueenSide = FileABB | FileBBB | FileCBB | FileDBB;
- const Bitboard CenterFiles = FileCBB | FileDBB | FileEBB | FileFBB;
- const Bitboard KingSide = FileEBB | FileFBB | FileGBB | FileHBB;
-
- const Bitboard KingFlank[COLOR_NB][FILE_NB] = {
- { QueenSide & WhiteCamp, QueenSide & WhiteCamp, QueenSide & WhiteCamp, CenterFiles & WhiteCamp,
- CenterFiles & WhiteCamp, KingSide & WhiteCamp, KingSide & WhiteCamp, KingSide & WhiteCamp },
- { QueenSide & BlackCamp, QueenSide & BlackCamp, QueenSide & BlackCamp, CenterFiles & BlackCamp,
- CenterFiles & BlackCamp, KingSide & BlackCamp, KingSide & BlackCamp, KingSide & BlackCamp },
- };
-
- template<Color Us, bool DoTrace>
- Score evaluate_threats(const Position& pos, const EvalInfo& ei) {
+ else
+ unsafeChecks |= b2 & attackedBy[Them][BISHOP];
- const Color Them = (Us == WHITE ? BLACK : WHITE);
- const Square Up = (Us == WHITE ? DELTA_N : DELTA_S);
- const Square Left = (Us == WHITE ? DELTA_NW : DELTA_SE);
- const Square Right = (Us == WHITE ? DELTA_NE : DELTA_SW);
- const Bitboard TRank2BB = (Us == WHITE ? Rank2BB : Rank7BB);
- const Bitboard TRank7BB = (Us == WHITE ? Rank7BB : Rank2BB);
+ // Enemy knights checks
+ knightChecks = attacks_bb<KNIGHT>(ksq) & attackedBy[Them][KNIGHT];
+ if (knightChecks & safe)
+ kingDanger += SafeCheck[KNIGHT][more_than_one(knightChecks & safe)];
+ else
+ unsafeChecks |= knightChecks;
+
+ // Find the squares that opponent attacks in our king flank, the squares
+ // which they attack twice in that flank, and the squares that we defend.
+ b1 = attackedBy[Them][ALL_PIECES] & KingFlank[file_of(ksq)] & Camp;
+ b2 = b1 & attackedBy2[Them];
+ b3 = attackedBy[Us][ALL_PIECES] & KingFlank[file_of(ksq)] & Camp;
+
+ int kingFlankAttack = popcount(b1) + popcount(b2);
+ int kingFlankDefense = popcount(b3);
+
+ kingDanger += kingAttackersCount[Them] * kingAttackersWeight[Them]
+ + 185 * popcount(kingRing[Us] & weak)
+ + 148 * popcount(unsafeChecks)
+ + 98 * popcount(pos.blockers_for_king(Us))
+ + 69 * kingAttacksCount[Them]
+ + 3 * kingFlankAttack * kingFlankAttack / 8
+ + mg_value(mobility[Them] - mobility[Us])
+ - 873 * !pos.count<QUEEN>(Them)
+ - 100 * bool(attackedBy[Us][KNIGHT] & attackedBy[Us][KING])
+ - 6 * mg_value(score) / 8
+ - 4 * kingFlankDefense
+ + 37;
+
+ // Transform the kingDanger units into a Score, and subtract it from the evaluation
+ if (kingDanger > 100)
+ score -= make_score(kingDanger * kingDanger / 4096, kingDanger / 16);
+
+ // Penalty when our king is on a pawnless flank
+ if (!(pos.pieces(PAWN) & KingFlank[file_of(ksq)]))
+ score -= PawnlessFlank;
+
+ // Penalty if king flank is under attack, potentially moving toward the king
+ score -= FlankAttacks * kingFlankAttack;
+
+ if (T)
+ Trace::add(KING, Us, score);
- enum { Minor, Rook };
+ return score;
+ }
- Bitboard b, weak, defended, safeThreats;
- Score score = SCORE_ZERO;
- // Small bonus if the opponent has loose pawns or pieces
- if ( (pos.pieces(Them) ^ pos.pieces(Them, QUEEN, KING))
- & ~(ei.attackedBy[Us][ALL_PIECES] | ei.attackedBy[Them][ALL_PIECES]))
- score += LooseEnemies;
+ // Evaluation::threats() assigns bonuses according to the types of the
+ // attacking and the attacked pieces.
- // Non-pawn enemies attacked by a pawn
- weak = (pos.pieces(Them) ^ pos.pieces(Them, PAWN)) & ei.attackedBy[Us][PAWN];
+ template<Tracing T> template<Color Us>
+ Score Evaluation<T>::threats() const {
- if (weak)
- {
- b = pos.pieces(Us, PAWN) & ( ~ei.attackedBy[Them][ALL_PIECES]
- | ei.attackedBy[Us][ALL_PIECES]);
+ constexpr Color Them = ~Us;
+ constexpr Direction Up = pawn_push(Us);
+ constexpr Bitboard TRank3BB = (Us == WHITE ? Rank3BB : Rank6BB);
- safeThreats = (shift_bb<Right>(b) | shift_bb<Left>(b)) & weak;
+ Bitboard b, weak, defended, nonPawnEnemies, stronglyProtected, safe;
+ Score score = SCORE_ZERO;
- if (weak ^ safeThreats)
- score += ThreatByHangingPawn;
+ // Non-pawn enemies
+ nonPawnEnemies = pos.pieces(Them) & ~pos.pieces(PAWN);
- while (safeThreats)
- score += ThreatBySafePawn[type_of(pos.piece_on(pop_lsb(&safeThreats)))];
- }
+ // Squares strongly protected by the enemy, either because they defend the
+ // square with a pawn, or because they defend the square twice and we don't.
+ stronglyProtected = attackedBy[Them][PAWN]
+ | (attackedBy2[Them] & ~attackedBy2[Us]);
- // Non-pawn enemies defended by a pawn
- defended = (pos.pieces(Them) ^ pos.pieces(Them, PAWN)) & ei.attackedBy[Them][PAWN];
+ // Non-pawn enemies, strongly protected
+ defended = nonPawnEnemies & stronglyProtected;
- // Enemies not defended by a pawn and under our attack
- weak = pos.pieces(Them)
- & ~ei.attackedBy[Them][PAWN]
- & ei.attackedBy[Us][ALL_PIECES];
+ // Enemies not strongly protected and under our attack
+ weak = pos.pieces(Them) & ~stronglyProtected & attackedBy[Us][ALL_PIECES];
- // Add a bonus according to the kind of attacking pieces
+ // Bonus according to the kind of attacking pieces
if (defended | weak)
{
- b = (defended | weak) & (ei.attackedBy[Us][KNIGHT] | ei.attackedBy[Us][BISHOP]);
+ b = (defended | weak) & (attackedBy[Us][KNIGHT] | attackedBy[Us][BISHOP]);
while (b)
- score += Threat[Minor][type_of(pos.piece_on(pop_lsb(&b)))];
+ score += ThreatByMinor[type_of(pos.piece_on(pop_lsb(&b)))];
- b = (pos.pieces(Them, QUEEN) | weak) & ei.attackedBy[Us][ROOK];
+ b = weak & attackedBy[Us][ROOK];
while (b)
- score += Threat[Rook ][type_of(pos.piece_on(pop_lsb(&b)))];
+ score += ThreatByRook[type_of(pos.piece_on(pop_lsb(&b)))];
+
+ if (weak & attackedBy[Us][KING])
+ score += ThreatByKing;
- score += Hanging * popcount(weak & ~ei.attackedBy[Them][ALL_PIECES]);
+ b = ~attackedBy[Them][ALL_PIECES]
+ | (nonPawnEnemies & attackedBy2[Us]);
+ score += Hanging * popcount(weak & b);
- b = weak & ei.attackedBy[Us][KING];
- if (b)
- score += ThreatByKing[more_than_one(b)];
+ // Additional bonus if weak piece is only protected by a queen
+ score += WeakQueenProtection * popcount(weak & attackedBy[Them][QUEEN]);
}
- // Bonus if some pawns can safely push and attack an enemy piece
- b = pos.pieces(Us, PAWN) & ~TRank7BB;
- b = shift_bb<Up>(b | (shift_bb<Up>(b & TRank2BB) & ~pos.pieces()));
+ // Bonus for restricting their piece moves
+ b = attackedBy[Them][ALL_PIECES]
+ & ~stronglyProtected
+ & attackedBy[Us][ALL_PIECES];
+ score += RestrictedPiece * popcount(b);
+
+ // Protected or unattacked squares
+ safe = ~attackedBy[Them][ALL_PIECES] | attackedBy[Us][ALL_PIECES];
- b &= ~pos.pieces()
- & ~ei.attackedBy[Them][PAWN]
- & (ei.attackedBy[Us][ALL_PIECES] | ~ei.attackedBy[Them][ALL_PIECES]);
+ // Bonus for attacking enemy pieces with our relatively safe pawns
+ b = pos.pieces(Us, PAWN) & safe;
+ b = pawn_attacks_bb<Us>(b) & nonPawnEnemies;
+ score += ThreatBySafePawn * popcount(b);
- b = (shift_bb<Left>(b) | shift_bb<Right>(b))
- & pos.pieces(Them)
- & ~ei.attackedBy[Us][PAWN];
+ // Find squares where our pawns can push on the next move
+ b = shift<Up>(pos.pieces(Us, PAWN)) & ~pos.pieces();
+ b |= shift<Up>(b & TRank3BB) & ~pos.pieces();
+ // Keep only the squares which are relatively safe
+ b &= ~attackedBy[Them][PAWN] & safe;
+
+ // Bonus for safe pawn threats on the next move
+ b = pawn_attacks_bb<Us>(b) & nonPawnEnemies;
score += ThreatByPawnPush * popcount(b);
- // King tropism: firstly, find squares that we attack in the enemy king flank
- b = ei.attackedBy[Us][ALL_PIECES] & KingFlank[Us][file_of(pos.square<KING>(Them))];
+ // Bonus for threats on the next moves against enemy queen
+ if (pos.count<QUEEN>(Them) == 1)
+ {
+ bool queenImbalance = pos.count<QUEEN>() == 1;
- // Secondly, add to the bitboard the squares which we attack twice in that flank
- // but which are not protected by a enemy pawn. Note the trick to shift away the
- // previous attack bits to the empty part of the bitboard.
- b = (b & ei.attackedBy2[Us] & ~ei.attackedBy[Them][PAWN])
- | (Us == WHITE ? b >> 4 : b << 4);
+ Square s = pos.square<QUEEN>(Them);
+ safe = mobilityArea[Us]
+ & ~pos.pieces(Us, PAWN)
+ & ~stronglyProtected;
- // Count all these squares with a single popcount
- score += make_score(7 * popcount(b), 0);
+ b = attackedBy[Us][KNIGHT] & attacks_bb<KNIGHT>(s);
+
+ score += KnightOnQueen * popcount(b & safe) * (1 + queenImbalance);
+
+ b = (attackedBy[Us][BISHOP] & attacks_bb<BISHOP>(s, pos.pieces()))
+ | (attackedBy[Us][ROOK ] & attacks_bb<ROOK >(s, pos.pieces()));
+
+ score += SliderOnQueen * popcount(b & safe & attackedBy2[Us]) * (1 + queenImbalance);
+ }
- if (DoTrace)
+ if (T)
Trace::add(THREAT, Us, score);
return score;
}
+ // Evaluation::passed() evaluates the passed pawns and candidate passed
+ // pawns of the given color.
- // evaluate_passed_pawns() evaluates the passed pawns of the given color
+ template<Tracing T> template<Color Us>
+ Score Evaluation<T>::passed() const {
- template<Color Us, bool DoTrace>
- Score evaluate_passed_pawns(const Position& pos, const EvalInfo& ei) {
+ constexpr Color Them = ~Us;
+ constexpr Direction Up = pawn_push(Us);
+ constexpr Direction Down = -Up;
- const Color Them = (Us == WHITE ? BLACK : WHITE);
+ auto king_proximity = [&](Color c, Square s) {
+ return std::min(distance(pos.square<KING>(c), s), 5);
+ };
- Bitboard b, squaresToQueen, defendedSquares, unsafeSquares;
+ Bitboard b, bb, squaresToQueen, unsafeSquares, blockedPassers, helpers;
Score score = SCORE_ZERO;
- b = ei.pi->passed_pawns(Us);
+ b = pe->passed_pawns(Us);
+
+ blockedPassers = b & shift<Down>(pos.pieces(Them, PAWN));
+ if (blockedPassers)
+ {
+ helpers = shift<Up>(pos.pieces(Us, PAWN))
+ & ~pos.pieces(Them)
+ & (~attackedBy2[Them] | attackedBy[Us][ALL_PIECES]);
+
+ // Remove blocked candidate passers that don't have help to pass
+ b &= ~blockedPassers
+ | shift<WEST>(helpers)
+ | shift<EAST>(helpers);
+ }
while (b)
{
Square s = pop_lsb(&b);
- assert(pos.pawn_passed(Us, s));
- assert(!(pos.pieces(PAWN) & forward_bb(Us, s)));
+ assert(!(pos.pieces(Them, PAWN) & forward_file_bb(Us, s + Up)));
- int r = relative_rank(Us, s) - RANK_2;
- int rr = r * (r - 1);
+ int r = relative_rank(Us, s);
- Value mbonus = Passed[MG][r], ebonus = Passed[EG][r];
+ Score bonus = PassedRank[r];
- if (rr)
+ if (r > RANK_3)
{
- Square blockSq = s + pawn_push(Us);
+ int w = 5 * r - 13;
+ Square blockSq = s + Up;
// Adjust bonus based on the king's proximity
- ebonus += distance(pos.square<KING>(Them), blockSq) * 5 * rr
- - distance(pos.square<KING>(Us ), blockSq) * 2 * rr;
+ bonus += make_score(0, ( king_proximity(Them, blockSq) * 19 / 4
+ - king_proximity(Us, blockSq) * 2) * w);
// If blockSq is not the queening square then consider also a second push
- if (relative_rank(Us, blockSq) != RANK_8)
- ebonus -= distance(pos.square<KING>(Us), blockSq + pawn_push(Us)) * rr;
+ if (r != RANK_7)
+ bonus -= make_score(0, king_proximity(Us, blockSq + Up) * w);
// If the pawn is free to advance, then increase the bonus
if (pos.empty(blockSq))
{
- // If there is a rook or queen attacking/defending the pawn from behind,
- // consider all the squaresToQueen. Otherwise consider only the squares
- // in the pawn's path attacked or occupied by the enemy.
- defendedSquares = unsafeSquares = squaresToQueen = forward_bb(Us, s);
-
- Bitboard bb = forward_bb(Them, s) & pos.pieces(ROOK, QUEEN) & pos.attacks_from<ROOK>(s);
+ squaresToQueen = forward_file_bb(Us, s);
+ unsafeSquares = passed_pawn_span(Us, s);
- if (!(pos.pieces(Us) & bb))
- defendedSquares &= ei.attackedBy[Us][ALL_PIECES];
+ bb = forward_file_bb(Them, s) & pos.pieces(ROOK, QUEEN);
if (!(pos.pieces(Them) & bb))
- unsafeSquares &= ei.attackedBy[Them][ALL_PIECES] | pos.pieces(Them);
+ unsafeSquares &= attackedBy[Them][ALL_PIECES];
- // If there aren't any enemy attacks, assign a big bonus. Otherwise
- // assign a smaller bonus if the block square isn't attacked.
- int k = !unsafeSquares ? 18 : !(unsafeSquares & blockSq) ? 8 : 0;
+ // If there are no enemy attacks on passed pawn span, assign a big bonus.
+ // Otherwise assign a smaller bonus if the path to queen is not attacked
+ // and even smaller bonus if it is attacked but block square is not.
+ int k = !unsafeSquares ? 35 :
+ !(unsafeSquares & squaresToQueen) ? 20 :
+ !(unsafeSquares & blockSq) ? 9 :
+ 0 ;
- // If the path to the queen is fully defended, assign a big bonus.
- // Otherwise assign a smaller bonus if the block square is defended.
- if (defendedSquares == squaresToQueen)
- k += 6;
+ // Assign a larger bonus if the block square is defended
+ if ((pos.pieces(Us) & bb) || (attackedBy[Us][ALL_PIECES] & blockSq))
+ k += 5;
- else if (defendedSquares & blockSq)
- k += 4;
-
- mbonus += k * rr, ebonus += k * rr;
+ bonus += make_score(k * w, k * w);
}
- else if (pos.pieces(Us) & blockSq)
- mbonus += rr + r * 2, ebonus += rr + r * 2;
- } // rr != 0
+ } // r > RANK_3
- score += make_score(mbonus, ebonus) + PassedFile[file_of(s)];
+ score += bonus - PassedFile * edge_distance(file_of(s));
}
- if (DoTrace)
+ if (T)
Trace::add(PASSED, Us, score);
- // Add the scores to the middlegame and endgame eval
return score;
}
- // evaluate_space() computes the space evaluation for a given side. The
- // space evaluation is a simple bonus based on the number of safe squares
- // available for minor pieces on the central four files on ranks 2--4. Safe
- // squares one, two or three squares behind a friendly pawn are counted
- // twice. Finally, the space bonus is multiplied by a weight. The aim is to
- // improve play on game opening.
- template<Color Us>
- Score evaluate_space(const Position& pos, const EvalInfo& ei) {
+ // Evaluation::space() computes a space evaluation for a given side, aiming to improve game
+ // play in the opening. It is based on the number of safe squares on the four central files
+ // on ranks 2 to 4. Completely safe squares behind a friendly pawn are counted twice.
+ // Finally, the space bonus is multiplied by a weight which decreases according to occupancy.
+
+ template<Tracing T> template<Color Us>
+ Score Evaluation<T>::space() const {
- const Color Them = (Us == WHITE ? BLACK : WHITE);
- const Bitboard SpaceMask =
- Us == WHITE ? (FileCBB | FileDBB | FileEBB | FileFBB) & (Rank2BB | Rank3BB | Rank4BB)
- : (FileCBB | FileDBB | FileEBB | FileFBB) & (Rank7BB | Rank6BB | Rank5BB);
+ // Early exit if, for example, both queens or 6 minor pieces have been exchanged
+ if (pos.non_pawn_material() < SpaceThreshold)
+ return SCORE_ZERO;
- // Find the safe squares for our pieces inside the area defined by
- // SpaceMask. A square is unsafe if it is attacked by an enemy
- // pawn, or if it is undefended and attacked by an enemy piece.
+ constexpr Color Them = ~Us;
+ constexpr Direction Down = -pawn_push(Us);
+ constexpr Bitboard SpaceMask =
+ Us == WHITE ? CenterFiles & (Rank2BB | Rank3BB | Rank4BB)
+ : CenterFiles & (Rank7BB | Rank6BB | Rank5BB);
+
+ // Find the available squares for our pieces inside the area defined by SpaceMask
Bitboard safe = SpaceMask
& ~pos.pieces(Us, PAWN)
- & ~ei.attackedBy[Them][PAWN]
- & (ei.attackedBy[Us][ALL_PIECES] | ~ei.attackedBy[Them][ALL_PIECES]);
+ & ~attackedBy[Them][PAWN];
// Find all squares which are at most three squares behind some friendly pawn
Bitboard behind = pos.pieces(Us, PAWN);
- behind |= (Us == WHITE ? behind >> 8 : behind << 8);
- behind |= (Us == WHITE ? behind >> 16 : behind << 16);
+ behind |= shift<Down>(behind);
+ behind |= shift<Down+Down>(behind);
- // Since SpaceMask[Us] is fully on our half of the board...
- assert(unsigned(safe >> (Us == WHITE ? 32 : 0)) == 0);
+ int bonus = popcount(safe) + popcount(behind & safe & ~attackedBy[Them][ALL_PIECES]);
+ int weight = pos.count<ALL_PIECES>(Us) - 3 + std::min(pe->blocked_count(), 9);
+ Score score = make_score(bonus * weight * weight / 16, 0);
- // ...count safe + (behind & safe) with a single popcount
- int bonus = popcount((Us == WHITE ? safe << 32 : safe >> 32) | (behind & safe));
- bonus = std::min(16, bonus);
- int weight = pos.count<ALL_PIECES>(Us);
+ if (T)
+ Trace::add(SPACE, Us, score);
- return make_score(bonus * weight * weight / 22, 0);
+ return score;
}
- // evaluate_initiative() computes the initiative correction value for the
- // position, i.e., second order bonus/malus based on the known attacking/defending
- // status of the players.
- Score evaluate_initiative(const Position& pos, int asymmetry, Value eg) {
+ // Evaluation::winnable() adjusts the midgame and endgame score components, based on
+ // the known attacking/defending status of the players. The final value is derived
+ // by interpolation from the midgame and endgame values.
- int kingDistance = distance<File>(pos.square<KING>(WHITE), pos.square<KING>(BLACK))
- - distance<Rank>(pos.square<KING>(WHITE), pos.square<KING>(BLACK));
- int pawns = pos.count<PAWN>(WHITE) + pos.count<PAWN>(BLACK);
+ template<Tracing T>
+ Value Evaluation<T>::winnable(Score score) const {
- // Compute the initiative bonus for the attacking side
- int initiative = 8 * (asymmetry + kingDistance - 15) + 12 * pawns;
-
- // Now apply the bonus: note that we find the attacking side by extracting
- // the sign of the endgame value, and that we carefully cap the bonus so
- // that the endgame score will never be divided by more than two.
- int value = ((eg > 0) - (eg < 0)) * std::max(initiative, -abs(eg / 2));
+ int outflanking = distance<File>(pos.square<KING>(WHITE), pos.square<KING>(BLACK))
+ - distance<Rank>(pos.square<KING>(WHITE), pos.square<KING>(BLACK));
- return make_score(0, value);
- }
+ bool pawnsOnBothFlanks = (pos.pieces(PAWN) & QueenSide)
+ && (pos.pieces(PAWN) & KingSide);
+ bool almostUnwinnable = outflanking < 0
+ && !pawnsOnBothFlanks;
- // evaluate_scale_factor() computes the scale factor for the winning side
- ScaleFactor evaluate_scale_factor(const Position& pos, const EvalInfo& ei, Value eg) {
+ bool infiltration = rank_of(pos.square<KING>(WHITE)) > RANK_4
+ || rank_of(pos.square<KING>(BLACK)) < RANK_5;
+ // Compute the initiative bonus for the attacking side
+ int complexity = 9 * pe->passed_count()
+ + 12 * pos.count<PAWN>()
+ + 9 * outflanking
+ + 21 * pawnsOnBothFlanks
+ + 24 * infiltration
+ + 51 * !pos.non_pawn_material()
+ - 43 * almostUnwinnable
+ -110 ;
+
+ Value mg = mg_value(score);
+ Value eg = eg_value(score);
+
+ // Now apply the bonus: note that we find the attacking side by extracting the
+ // sign of the midgame or endgame values, and that we carefully cap the bonus
+ // so that the midgame and endgame scores do not change sign after the bonus.
+ int u = ((mg > 0) - (mg < 0)) * std::clamp(complexity + 50, -abs(mg), 0);
+ int v = ((eg > 0) - (eg < 0)) * std::max(complexity, -abs(eg));
+
+ mg += u;
+ eg += v;
+
+ // Compute the scale factor for the winning side
Color strongSide = eg > VALUE_DRAW ? WHITE : BLACK;
- ScaleFactor sf = ei.me->scale_factor(pos, strongSide);
+ int sf = me->scale_factor(pos, strongSide);
- // If we don't already have an unusual scale factor, check for certain
- // types of endgames, and use a lower scale for those.
- if ( ei.me->game_phase() < PHASE_MIDGAME
- && (sf == SCALE_FACTOR_NORMAL || sf == SCALE_FACTOR_ONEPAWN))
+ // If scale factor is not already specific, scale down via general heuristics
+ if (sf == SCALE_FACTOR_NORMAL)
{
if (pos.opposite_bishops())
{
- // Endgame with opposite-colored bishops and no other pieces (ignoring pawns)
- // is almost a draw, in case of KBP vs KB, it is even more a draw.
if ( pos.non_pawn_material(WHITE) == BishopValueMg
&& pos.non_pawn_material(BLACK) == BishopValueMg)
- sf = more_than_one(pos.pieces(PAWN)) ? ScaleFactor(31) : ScaleFactor(9);
-
- // Endgame with opposite-colored bishops, but also other pieces. Still
- // a bit drawish, but not as drawish as with only the two bishops.
+ sf = 18 + 4 * popcount(pe->passed_pawns(strongSide));
else
- sf = ScaleFactor(46);
+ sf = 22 + 3 * pos.count<ALL_PIECES>(strongSide);
}
- // Endings where weaker side can place his king in front of the opponent's
- // pawns are drawish.
- else if ( abs(eg) <= BishopValueEg
- && ei.pi->pawn_span(strongSide) <= 1
- && !pos.pawn_passed(~strongSide, pos.square<KING>(~strongSide)))
- sf = ei.pi->pawn_span(strongSide) ? ScaleFactor(51) : ScaleFactor(37);
+ else if ( pos.non_pawn_material(WHITE) == RookValueMg
+ && pos.non_pawn_material(BLACK) == RookValueMg
+ && pos.count<PAWN>(strongSide) - pos.count<PAWN>(~strongSide) <= 1
+ && bool(KingSide & pos.pieces(strongSide, PAWN)) != bool(QueenSide & pos.pieces(strongSide, PAWN))
+ && (attacks_bb<KING>(pos.square<KING>(~strongSide)) & pos.pieces(~strongSide, PAWN)))
+ sf = 36;
+ else if (pos.count<QUEEN>() == 1)
+ sf = 37 + 3 * (pos.count<QUEEN>(WHITE) == 1 ? pos.count<BISHOP>(BLACK) + pos.count<KNIGHT>(BLACK)
+ : pos.count<BISHOP>(WHITE) + pos.count<KNIGHT>(WHITE));
+ else
+ sf = std::min(sf, 36 + 7 * pos.count<PAWN>(strongSide));
+ }
+
+ // Interpolate between the middlegame and (scaled by 'sf') endgame score
+ v = mg * int(me->game_phase())
+ + eg * int(PHASE_MIDGAME - me->game_phase()) * ScaleFactor(sf) / SCALE_FACTOR_NORMAL;
+ v /= PHASE_MIDGAME;
+
+ if (T)
+ {
+ Trace::add(WINNABLE, make_score(u, eg * ScaleFactor(sf) / SCALE_FACTOR_NORMAL - eg_value(score)));
+ Trace::add(TOTAL, make_score(mg, eg * ScaleFactor(sf) / SCALE_FACTOR_NORMAL));
}
- return sf;
+ return Value(v);
}
-} // namespace
+ // Evaluation::value() is the main function of the class. It computes the various
+ // parts of the evaluation and returns the value of the position from the point
+ // of view of the side to move.
-/// evaluate() is the main evaluation function. It returns a static evaluation
-/// of the position from the point of view of the side to move.
+ template<Tracing T>
+ Value Evaluation<T>::value() {
-template<bool DoTrace>
-Value Eval::evaluate(const Position& pos) {
+ assert(!pos.checkers());
- assert(!pos.checkers());
+ // Probe the material hash table
+ me = Material::probe(pos);
- EvalInfo ei;
- Score score, mobility[COLOR_NB] = { SCORE_ZERO, SCORE_ZERO };
+ // If we have a specialized evaluation function for the current material
+ // configuration, call it and return.
+ if (me->specialized_eval_exists())
+ return me->evaluate(pos);
- // Initialize score by reading the incrementally updated scores included in
- // the position object (material + piece square tables). Score is computed
- // internally from the white point of view.
- score = pos.psq_score();
+ // Initialize score by reading the incrementally updated scores included in
+ // the position object (material + piece square tables) and the material
+ // imbalance. Score is computed internally from the white point of view.
+ Score score = pos.psq_score() + me->imbalance() + pos.this_thread()->contempt;
- // Probe the material hash table
- ei.me = Material::probe(pos);
- score += ei.me->imbalance();
+ // Probe the pawn hash table
+ pe = Pawns::probe(pos);
+ score += pe->pawn_score(WHITE) - pe->pawn_score(BLACK);
- // If we have a specialized evaluation function for the current material
- // configuration, call it and return.
- if (ei.me->specialized_eval_exists())
- return ei.me->evaluate(pos);
+ // Early exit if score is high
+ auto lazy_skip = [&](Value lazyThreshold) {
+ return abs(mg_value(score) + eg_value(score)) / 2 > lazyThreshold + pos.non_pawn_material() / 64;
+ };
- // Probe the pawn hash table
- ei.pi = Pawns::probe(pos);
- score += ei.pi->pawns_score();
+ if (lazy_skip(LazyThreshold1))
+ goto make_v;
- // Initialize attack and king safety bitboards
- ei.attackedBy[WHITE][ALL_PIECES] = ei.attackedBy[BLACK][ALL_PIECES] = 0;
- ei.attackedBy[WHITE][KING] = pos.attacks_from<KING>(pos.square<KING>(WHITE));
- ei.attackedBy[BLACK][KING] = pos.attacks_from<KING>(pos.square<KING>(BLACK));
- eval_init<WHITE>(pos, ei);
- eval_init<BLACK>(pos, ei);
+ // Main evaluation begins here
+ initialize<WHITE>();
+ initialize<BLACK>();
- // Pawns blocked or on ranks 2 and 3 will be excluded from the mobility area
- Bitboard blockedPawns[] = {
- pos.pieces(WHITE, PAWN) & (shift_bb<DELTA_S>(pos.pieces()) | Rank2BB | Rank3BB),
- pos.pieces(BLACK, PAWN) & (shift_bb<DELTA_N>(pos.pieces()) | Rank7BB | Rank6BB)
- };
+ // Pieces evaluated first (also populates attackedBy, attackedBy2).
+ // Note that the order of evaluation of the terms is left unspecified.
+ score += pieces<WHITE, KNIGHT>() - pieces<BLACK, KNIGHT>()
+ + pieces<WHITE, BISHOP>() - pieces<BLACK, BISHOP>()
+ + pieces<WHITE, ROOK >() - pieces<BLACK, ROOK >()
+ + pieces<WHITE, QUEEN >() - pieces<BLACK, QUEEN >();
- // Do not include in mobility area squares protected by enemy pawns, or occupied
- // by our blocked pawns or king.
- Bitboard mobilityArea[] = {
- ~(ei.attackedBy[BLACK][PAWN] | blockedPawns[WHITE] | pos.square<KING>(WHITE)),
- ~(ei.attackedBy[WHITE][PAWN] | blockedPawns[BLACK] | pos.square<KING>(BLACK))
- };
+ score += mobility[WHITE] - mobility[BLACK];
- // Evaluate all pieces but king and pawns
- score += evaluate_pieces<DoTrace>(pos, ei, mobility, mobilityArea);
- score += mobility[WHITE] - mobility[BLACK];
+ // More complex interactions that require fully populated attack bitboards
+ score += king< WHITE>() - king< BLACK>()
+ + passed< WHITE>() - passed< BLACK>();
- // Evaluate kings after all other pieces because we need full attack
- // information when computing the king safety evaluation.
- score += evaluate_king<WHITE, DoTrace>(pos, ei)
- - evaluate_king<BLACK, DoTrace>(pos, ei);
+ if (lazy_skip(LazyThreshold2))
+ goto make_v;
- // Evaluate tactical threats, we need full attack information including king
- score += evaluate_threats<WHITE, DoTrace>(pos, ei)
- - evaluate_threats<BLACK, DoTrace>(pos, ei);
+ score += threats<WHITE>() - threats<BLACK>()
+ + space< WHITE>() - space< BLACK>();
- // Evaluate passed pawns, we need full attack information including king
- score += evaluate_passed_pawns<WHITE, DoTrace>(pos, ei)
- - evaluate_passed_pawns<BLACK, DoTrace>(pos, ei);
+make_v:
+ // Derive single value from mg and eg parts of score
+ Value v = winnable(score);
- // If both sides have only pawns, score for potential unstoppable pawns
- if (!pos.non_pawn_material(WHITE) && !pos.non_pawn_material(BLACK))
- {
- Bitboard b;
- if ((b = ei.pi->passed_pawns(WHITE)) != 0)
- score += Unstoppable * int(relative_rank(WHITE, frontmost_sq(WHITE, b)));
+ // In case of tracing add all remaining individual evaluation terms
+ if (T)
+ {
+ Trace::add(MATERIAL, pos.psq_score());
+ Trace::add(IMBALANCE, me->imbalance());
+ Trace::add(PAWN, pe->pawn_score(WHITE), pe->pawn_score(BLACK));
+ Trace::add(MOBILITY, mobility[WHITE], mobility[BLACK]);
+ }
+
+ // Evaluation grain
+ v = (v / 16) * 16;
- if ((b = ei.pi->passed_pawns(BLACK)) != 0)
- score -= Unstoppable * int(relative_rank(BLACK, frontmost_sq(BLACK, b)));
+ // Side to move point of view
+ v = (pos.side_to_move() == WHITE ? v : -v) + Tempo;
+
+ return v;
}
- // Evaluate space for both sides, only during opening
- if (pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK) >= 12222)
- score += evaluate_space<WHITE>(pos, ei)
- - evaluate_space<BLACK>(pos, ei);
+} // namespace
- // Evaluate position potential for the winning side
- score += evaluate_initiative(pos, ei.pi->pawn_asymmetry(), eg_value(score));
- // Evaluate scale factor for the winning side
- ScaleFactor sf = evaluate_scale_factor(pos, ei, eg_value(score));
+/// evaluate() is the evaluator for the outer world. It returns a static
+/// evaluation of the position from the point of view of the side to move.
- // Interpolate between a middlegame and a (scaled by 'sf') endgame score
- Value v = mg_value(score) * int(ei.me->game_phase())
- + eg_value(score) * int(PHASE_MIDGAME - ei.me->game_phase()) * sf / SCALE_FACTOR_NORMAL;
+Value Eval::evaluate(const Position& pos) {
- v /= int(PHASE_MIDGAME);
+ bool classical = !Eval::useNNUE
+ || abs(eg_value(pos.psq_score())) * 16 > NNUEThreshold1 * (16 + pos.rule50_count());
+ Value v = classical ? Evaluation<NO_TRACE>(pos).value()
+ : NNUE::evaluate(pos) * 5 / 4 + Tempo;
- // In case of tracing add all remaining individual evaluation terms
- if (DoTrace)
- {
- Trace::add(MATERIAL, pos.psq_score());
- Trace::add(IMBALANCE, ei.me->imbalance());
- Trace::add(PAWN, ei.pi->pawns_score());
- Trace::add(MOBILITY, mobility[WHITE], mobility[BLACK]);
- Trace::add(SPACE, evaluate_space<WHITE>(pos, ei)
- , evaluate_space<BLACK>(pos, ei));
- Trace::add(TOTAL, score);
- }
+ if (classical && Eval::useNNUE && abs(v) * 16 < NNUEThreshold2 * (16 + pos.rule50_count()))
+ v = NNUE::evaluate(pos) * 5 / 4 + Tempo;
- return (pos.side_to_move() == WHITE ? v : -v) + Eval::Tempo; // Side to move point of view
-}
+ // Damp down the evaluation linearly when shuffling
+ v = v * (100 - pos.rule50_count()) / 100;
-// Explicit template instantiations
-template Value Eval::evaluate<true >(const Position&);
-template Value Eval::evaluate<false>(const Position&);
+ // Guarantee evaluation does not hit the tablebase range
+ v = std::clamp(v, VALUE_TB_LOSS_IN_MAX_PLY + 1, VALUE_TB_WIN_IN_MAX_PLY - 1);
+ return v;
+}
/// trace() is like evaluate(), but instead of returning a value, it returns
/// a string (suitable for outputting to stdout) that contains the detailed
/// descriptions and values of each evaluation term. Useful for debugging.
+/// Trace scores are from white's point of view
std::string Eval::trace(const Position& pos) {
- std::memset(scores, 0, sizeof(scores));
-
- Value v = evaluate<true>(pos);
- v = pos.side_to_move() == WHITE ? v : -v; // White's point of view
+ if (pos.checkers())
+ return "Final evaluation: none (in check)";
std::stringstream ss;
- ss << std::showpoint << std::noshowpos << std::fixed << std::setprecision(2)
- << " Eval term | White | Black | Total \n"
- << " | MG EG | MG EG | MG EG \n"
- << "----------------+-------------+-------------+-------------\n"
- << " Material | " << Term(MATERIAL)
- << " Imbalance | " << Term(IMBALANCE)
- << " Pawns | " << Term(PAWN)
- << " Knights | " << Term(KNIGHT)
- << " Bishop | " << Term(BISHOP)
- << " Rooks | " << Term(ROOK)
- << " Queens | " << Term(QUEEN)
- << " Mobility | " << Term(MOBILITY)
- << " King safety | " << Term(KING)
- << " Threats | " << Term(THREAT)
- << " Passed pawns | " << Term(PASSED)
- << " Space | " << Term(SPACE)
- << "----------------+-------------+-------------+-------------\n"
- << " Total | " << Term(TOTAL);
-
- ss << "\nTotal Evaluation: " << to_cp(v) << " (white side)\n";
+ ss << std::showpoint << std::noshowpos << std::fixed << std::setprecision(2);
- return ss.str();
-}
+ Value v;
+ std::memset(scores, 0, sizeof(scores));
-/// init() computes evaluation weights, usually at startup
-
-void Eval::init() {
+ pos.this_thread()->contempt = SCORE_ZERO; // Reset any dynamic contempt
- const int MaxSlope = 322;
- const int Peak = 47410;
- int t = 0;
+ v = Evaluation<TRACE>(pos).value();
- for (int i = 0; i < 400; ++i)
+ ss << std::showpoint << std::noshowpos << std::fixed << std::setprecision(2)
+ << " Term | White | Black | Total \n"
+ << " | MG EG | MG EG | MG EG \n"
+ << " ------------+-------------+-------------+------------\n"
+ << " Material | " << Term(MATERIAL)
+ << " Imbalance | " << Term(IMBALANCE)
+ << " Pawns | " << Term(PAWN)
+ << " Knights | " << Term(KNIGHT)
+ << " Bishops | " << Term(BISHOP)
+ << " Rooks | " << Term(ROOK)
+ << " Queens | " << Term(QUEEN)
+ << " Mobility | " << Term(MOBILITY)
+ << " King safety | " << Term(KING)
+ << " Threats | " << Term(THREAT)
+ << " Passed | " << Term(PASSED)
+ << " Space | " << Term(SPACE)
+ << " Winnable | " << Term(WINNABLE)
+ << " ------------+-------------+-------------+------------\n"
+ << " Total | " << Term(TOTAL);
+
+ v = pos.side_to_move() == WHITE ? v : -v;
+
+ ss << "\nClassical evaluation: " << to_cp(v) << " (white side)\n";
+
+ if (Eval::useNNUE)
{
- t = std::min(Peak, std::min(i * i - 16, t + MaxSlope));
- KingDanger[i] = make_score(t * 268 / 7700, 0);
+ v = NNUE::evaluate(pos);
+ v = pos.side_to_move() == WHITE ? v : -v;
+ ss << "\nNNUE evaluation: " << to_cp(v) << " (white side)\n";
}
+
+ v = evaluate(pos);
+ v = pos.side_to_move() == WHITE ? v : -v;
+ ss << "\nFinal evaluation: " << to_cp(v) << " (white side)\n";
+
+ return ss.str();
}