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-2018 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
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 <iomanip>
#include <sstream>
-#include "bitcount.h"
+#include "bitboard.h"
#include "evaluate.h"
#include "material.h"
#include "pawns.h"
+#include "thread.h"
-namespace {
+namespace Trace {
- // Struct EvalInfo contains various information computed and collected
- // by the evaluation functions.
- struct EvalInfo {
+ enum Tracing { NO_TRACE, TRACE };
- // Pointers to material and pawn hash table entries
- Material::Entry* mi;
- Pawns::Entry* pi;
+ enum Term { // The first 8 entries are reserved for PieceType
+ MATERIAL = 8, IMBALANCE, MOBILITY, THREAT, PASSED, SPACE, INITIATIVE, TOTAL, TERM_NB
+ };
- // attackedBy[color][piece type] is a bitboard representing all squares
- // attacked by a given color and piece type, attackedBy[color][ALL_PIECES]
- // contains all squares attacked by the given color.
- Bitboard attackedBy[COLOR_NB][PIECE_TYPE_NB];
+ Score scores[TERM_NB][COLOR_NB];
- // 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];
+ double to_cp(Value v) { return double(v) / PawnValueEg; }
- // 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];
+ void add(int idx, Color c, Score s) {
+ scores[idx][c] = s;
+ }
- // kingAttackersWeight[color] is the sum of the "weight" 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];
+ void add(int idx, Score w, Score b = SCORE_ZERO) {
+ scores[idx][WHITE] = w;
+ scores[idx][BLACK] = b;
+ }
- // kingAdjacentZoneAttacksCount[color] is the number of attacks to squares
- // directly adjacent to the king of the given color. Pieces which attack
- // more than one square are counted multiple times. For instance, if black's
- // king is on g8 and there's a white knight on g5, this knight adds
- // 2 to kingAdjacentZoneAttacksCount[BLACK].
- int kingAdjacentZoneAttacksCount[COLOR_NB];
+ 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;
+ }
- Bitboard pinnedPieces[COLOR_NB];
- };
+ std::ostream& operator<<(std::ostream& os, Term t) {
- namespace Tracing {
+ if (t == MATERIAL || t == IMBALANCE || t == INITIATIVE || t == TOTAL)
+ os << " ---- ----" << " | " << " ---- ----";
+ else
+ os << scores[t][WHITE] << " | " << scores[t][BLACK];
- enum Terms { // First 8 entries are for PieceType
- MATERIAL = 8, IMBALANCE, MOBILITY, THREAT, PASSED, SPACE, TOTAL, TERMS_NB
- };
+ os << " | " << scores[t][WHITE] - scores[t][BLACK] << "\n";
+ return os;
+ }
+}
- Score scores[COLOR_NB][TERMS_NB];
- EvalInfo ei;
- ScaleFactor sf;
+using namespace Trace;
- double to_cp(Value v);
- void write(int idx, Color c, Score s);
- void write(int idx, Score w, Score b = SCORE_ZERO);
- void print(std::stringstream& ss, const char* name, int idx);
- std::string do_trace(const Position& pos);
- }
+namespace {
- // Evaluation weights, indexed by evaluation term
- enum { Mobility, PawnStructure, PassedPawns, Space, KingSafety };
- const struct Weight { int mg, eg; } Weights[] = {
- {289, 344}, {233, 201}, {221, 273}, {46, 0}, {322, 0}
+ constexpr Bitboard QueenSide = FileABB | FileBBB | FileCBB | FileDBB;
+ constexpr Bitboard CenterFiles = FileCBB | FileDBB | FileEBB | FileFBB;
+ constexpr Bitboard KingSide = FileEBB | FileFBB | FileGBB | FileHBB;
+ constexpr Bitboard Center = (FileDBB | FileEBB) & (Rank4BB | Rank5BB);
+
+ constexpr Bitboard KingFlank[FILE_NB] = {
+ QueenSide, QueenSide, QueenSide,
+ CenterFiles, CenterFiles,
+ KingSide, KingSide, KingSide
};
- #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 not occupied by
- // friendly pieces.
- const Score MobilityBonus[][32] = {
- {}, {},
- { S(-65,-50), S(-42,-30), S(-9,-10), S( 3, 0), S(15, 10), S(27, 20), // Knights
- S( 37, 28), S( 42, 31), S(44, 33) },
- { S(-52,-47), S(-28,-23), S( 6, 1), S(20, 15), S(34, 29), S(48, 43), // Bishops
- S( 60, 55), S( 68, 63), S(74, 68), S(77, 72), S(80, 75), S(82, 77),
- S( 84, 79), S( 86, 81) },
- { S(-47,-53), S(-31,-26), S(-5, 0), S( 1, 16), S( 7, 32), S(13, 48), // Rooks
- S( 18, 64), S( 22, 80), S(26, 96), S(29,109), S(31,115), S(33,119),
- S( 35,122), S( 36,123), S(37,124) },
- { S(-42,-40), S(-28,-23), S(-5, -7), S( 0, 0), S( 6, 10), S(11, 19), // Queens
- S( 13, 29), S( 18, 38), S(20, 40), S(21, 41), S(22, 41), S(22, 41),
- S( 22, 41), S( 23, 41), S(24, 41), S(25, 41), S(25, 41), S(25, 41),
- S( 25, 41), S( 25, 41), S(25, 41), S(25, 41), S(25, 41), S(25, 41),
- S( 25, 41), S( 25, 41), S(25, 41), S(25, 41) }
+ // Threshold for lazy and space evaluation
+ constexpr Value LazyThreshold = Value(1500);
+ constexpr Value SpaceThreshold = Value(12222);
+
+ // KingAttackWeights[PieceType] contains king attack weights by piece type
+ constexpr int KingAttackWeights[PIECE_TYPE_NB] = { 0, 0, 78, 56, 45, 11 };
+
+ // Penalties for enemy's safe checks
+ constexpr int QueenSafeCheck = 780;
+ constexpr int RookSafeCheck = 880;
+ constexpr int BishopSafeCheck = 435;
+ constexpr int KnightSafeCheck = 790;
+
+#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(-75,-76), S(-57,-54), S( -9,-28), S( -2,-10), S( 6, 5), S( 14, 12), // Knights
+ S( 22, 26), S( 29, 29), S( 36, 29) },
+ { S(-48,-59), S(-20,-23), S( 16, -3), S( 26, 13), S( 38, 24), S( 51, 42), // Bishops
+ 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(-58,-76), S(-27,-18), S(-15, 28), S(-10, 55), S( -5, 69), S( -2, 82), // Rooks
+ S( 9,112), S( 16,118), S( 30,132), S( 29,142), S( 32,155), S( 38,165),
+ S( 46,166), S( 48,169), S( 58,171) },
+ { S(-39,-36), S(-21,-15), S( 3, 8), S( 3, 18), S( 14, 34), S( 22, 54), // Queens
+ S( 28, 61), S( 41, 73), S( 43, 79), S( 48, 92), S( 56, 94), S( 60,104),
+ S( 60,113), S( 66,120), S( 67,123), S( 70,126), S( 71,133), S( 73,136),
+ S( 79,140), S( 88,143), S( 88,148), S( 99,166), S(102,170), S(102,175),
+ S(106,184), S(109,191), S(113,206), S(116,212) }
};
- // Outpost[PieceType][Square] contains bonuses for knights and bishops outposts,
- // indexed by piece type and square (from white's point of view).
- const Value Outpost[][SQUARE_NB] = {
- {// A B C D E F G H
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // Knights
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0),
- V(0), V(0), V(4), V(8), V(8), V(4), V(0), V(0),
- V(0), V(4),V(17),V(26),V(26),V(17), V(4), V(0),
- V(0), V(8),V(26),V(35),V(35),V(26), V(8), V(0),
- V(0), V(4),V(17),V(17),V(17),V(17), V(4), V(0) },
- {
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // Bishops
- V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0),
- V(0), V(0), V(5), V(5), V(5), V(5), V(0), V(0),
- V(0), V(5),V(10),V(10),V(10),V(10), V(5), V(0),
- V(0),V(10),V(21),V(21),V(21),V(21),V(10), V(0),
- V(0), V(5), V(8), V(8), V(8), V(8), V(5), V(0) }
+ // Outpost[knight/bishop][supported by pawn] contains bonuses for minor
+ // pieces if they occupy or can reach an outpost square, bigger if that
+ // square is supported by a pawn.
+ constexpr Score Outpost[][2] = {
+ { S(22, 6), S(36,12) }, // Knight
+ { S( 9, 2), S(15, 5) } // Bishop
};
- // Threat[defended/weak][minor/major attacking][attacked PieceType] contains
- // bonuses according to which piece type attacks which one.
- const Score Threat[][2][PIECE_TYPE_NB] = {
- { { S(0, 0), S( 0, 0), S(19, 37), S(24, 37), S(44, 97), S(35,106) }, // Defended Minor
- { S(0, 0), S( 0, 0), S( 9, 14), S( 9, 14), S( 7, 14), S(24, 48) } }, // Defended Major
- { { S(0, 0), S( 0,32), S(33, 41), S(31, 50), S(41,100), S(35,104) }, // Weak Minor
- { S(0, 0), S( 0,27), S(26, 57), S(26, 57), S(0 , 43), S(23, 51) } } // Weak Major
+ // RookOnFile[semiopen/open] contains bonuses for each rook when there is
+ // no (friendly) pawn on the rook file.
+ constexpr Score RookOnFile[] = { S(20, 7), S(45, 20) };
+
+ // 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(0, 31), S(39, 42), S(57, 44), S(68, 112), S(47, 120)
};
- // ThreatenedByPawn[PieceType] contains a penalty according to which piece
- // type is attacked by an enemy pawn.
- const Score ThreatenedByPawn[] = {
- S(0, 0), S(0, 0), S(87, 118), S(84, 122), S(114, 203), S(121, 217)
+ constexpr Score ThreatByRook[PIECE_TYPE_NB] = {
+ S(0, 0), S(0, 24), S(38, 71), S(38, 61), S(0, 38), S(36, 38)
};
- // Assorted bonuses and penalties used by evaluation
- const Score KingOnOne = S( 2, 58);
- const Score KingOnMany = S( 6,125);
- const Score RookOnPawn = S( 7, 27);
- const Score RookOnOpenFile = S(43, 21);
- const Score RookOnSemiOpenFile = S(19, 10);
- const Score BishopPawns = S( 8, 12);
- const Score MinorBehindPawn = S(16, 0);
- const Score TrappedRook = S(92, 0);
- const Score Unstoppable = S( 0, 20);
- const Score Hanging = S(31, 26);
- const Score PawnAttackThreat = S(20, 20);
- const Score PawnSafePush = S( 5 , 5);
-
- // 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
-
- // SpaceMask[Color] contains the area of the board which is considered
- // by the space evaluation. In the middlegame, each side is given a bonus
- // based on how many squares inside this area are safe and available for
- // friendly minor pieces.
- const Bitboard SpaceMask[] = {
- (FileCBB | FileDBB | FileEBB | FileFBB) & (Rank2BB | Rank3BB | Rank4BB),
- (FileCBB | FileDBB | FileEBB | FileFBB) & (Rank7BB | Rank6BB | Rank5BB)
+ // ThreatByKing[on one/on many] contains bonuses for king attacks on
+ // pawns or pieces which are not pawn-defended.
+ constexpr Score ThreatByKing[] = { S(3, 65), S(9, 145) };
+
+ // PassedRank[Rank] contains a bonus according to the rank of a passed pawn
+ constexpr Score PassedRank[RANK_NB] = {
+ S(0, 0), S(5, 7), S(5, 13), S(18, 23), S(74, 58), S(164, 166), S(268, 243)
};
- // 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[].
- //
- // KingAttackWeights[PieceType] contains king attack weights by piece type
- const int KingAttackWeights[] = { 0, 0, 7, 5, 4, 1 };
-
- // Bonuses for enemy's safe checks
- const int QueenContactCheck = 89;
- const int RookContactCheck = 71;
- const int QueenCheck = 50;
- const int RookCheck = 37;
- const int BishopCheck = 6;
- const int KnightCheck = 14;
-
- // KingDanger[attackUnits] contains the actual king danger weighted
- // scores, indexed by a calculated integer number.
- Score KingDanger[512];
-
- // apply_weight() weighs score 's' by weight 'w' trying to prevent overflow
- Score apply_weight(Score s, const Weight& w) {
- return make_score(mg_value(s) * w.mg / 256, eg_value(s) * w.eg / 256);
- }
+ // PassedFile[File] contains a bonus according to the file of a passed pawn
+ constexpr Score PassedFile[FILE_NB] = {
+ S( 15, 7), S(-5, 14), S( 1, -5), S(-22,-11),
+ S(-22,-11), S( 1, -5), S(-5, 14), S( 15, 7)
+ };
+ // PassedDanger[Rank] contains a term to weight the passed score
+ constexpr int PassedDanger[RANK_NB] = { 0, 0, 0, 3, 6, 12, 21 };
+
+ // KingProtector[PieceType-2] contains a penalty according to distance from king
+ constexpr Score KingProtector[] = { S(3, 5), S(4, 3), S(3, 0), S(1, -1) };
+
+ // Assorted bonuses and penalties
+ constexpr Score BishopPawns = S( 3, 5);
+ constexpr Score CloseEnemies = S( 7, 0);
+ constexpr Score Connectivity = S( 3, 1);
+ constexpr Score CorneredBishop = S( 50, 50);
+ constexpr Score Hanging = S( 52, 30);
+ constexpr Score HinderPassedPawn = S( 8, 1);
+ constexpr Score KnightOnQueen = S( 21, 11);
+ constexpr Score LongDiagonalBishop = S( 22, 0);
+ constexpr Score MinorBehindPawn = S( 16, 0);
+ constexpr Score Overload = S( 10, 5);
+ constexpr Score PawnlessFlank = S( 20, 80);
+ constexpr Score RookOnPawn = S( 8, 24);
+ constexpr Score SliderOnQueen = S( 42, 21);
+ constexpr Score ThreatByPawnPush = S( 47, 26);
+ constexpr Score ThreatByRank = S( 16, 3);
+ constexpr Score ThreatBySafePawn = S(175,168);
+ constexpr Score TrappedRook = S( 92, 0);
+ constexpr Score WeakQueen = S( 50, 10);
+ constexpr Score WeakUnopposedPawn = S( 5, 25);
+
+#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;
+ ScaleFactor scale_factor(Value eg) const;
+ Score initiative(Value eg) const;
+
+ const Position& pos;
+ Material::Entry* me;
+ Pawns::Entry* pe;
+ Bitboard mobilityArea[COLOR_NB];
+ Score mobility[COLOR_NB] = { SCORE_ZERO, SCORE_ZERO };
- // init_eval_info() initializes king bitboards for given color adding
- // pawn attacks. To be done at the beginning of the evaluation.
+ // 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];
- template<Color Us>
- void init_eval_info(const Position& pos, EvalInfo& ei) {
+ // 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];
- const Color Them = (Us == WHITE ? BLACK : WHITE);
- const Square Down = (Us == WHITE ? DELTA_S : DELTA_N);
+ // kingRing[color] are the squares adjacent to the king, plus (only for a
+ // king on its first rank) the squares two ranks in front. For instance,
+ // if black's king is on g8, kingRing[BLACK] is f8, h8, f7, g7, h7, f6, g6
+ // and h6. It is set to 0 when king safety evaluation is skipped.
+ Bitboard kingRing[COLOR_NB];
- ei.pinnedPieces[Us] = pos.pinned_pieces(Us);
+ // 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];
- Bitboard b = ei.attackedBy[Them][KING] = pos.attacks_from<KING>(pos.king_square(Them));
- ei.attackedBy[Us][ALL_PIECES] = ei.attackedBy[Us][PAWN] = ei.pi->pawn_attacks(Us);
+ // 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];
- // 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] = b ? popcount<Max15>(b) : 0;
- ei.kingAdjacentZoneAttacksCount[Us] = ei.kingAttackersWeight[Us] = 0;
- }
- else
- ei.kingRing[Them] = ei.kingAttackersCount[Us] = 0;
- }
+ // 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];
+ };
- // evaluate_outpost() evaluates bishop and knight outpost squares
+ // 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.
+ template<Tracing T> template<Color Us>
+ void Evaluation<T>::initialize() {
- template<PieceType Pt, Color Us>
- Score evaluate_outpost(const Position& pos, const EvalInfo& ei, Square s) {
+ constexpr Color Them = (Us == WHITE ? BLACK : WHITE);
+ constexpr Direction Up = (Us == WHITE ? NORTH : SOUTH);
+ constexpr Direction Down = (Us == WHITE ? SOUTH : NORTH);
+ constexpr Bitboard LowRanks = (Us == WHITE ? Rank2BB | Rank3BB: Rank7BB | Rank6BB);
- const Color Them = (Us == WHITE ? BLACK : WHITE);
+ // Find our pawns that are blocked or on the first two ranks
+ Bitboard b = pos.pieces(Us, PAWN) & (shift<Down>(pos.pieces()) | LowRanks);
- assert (Pt == BISHOP || Pt == KNIGHT);
+ // Squares occupied by those pawns, by our king or queen, or controlled by enemy pawns
+ // are excluded from the mobility area.
+ mobilityArea[Us] = ~(b | pos.pieces(Us, KING, QUEEN) | pe->pawn_attacks(Them));
- // Initial bonus based on square
- Value bonus = Outpost[Pt == BISHOP][relative_square(Us, s)];
+ // Initialise attackedBy bitboards for kings and pawns
+ attackedBy[Us][KING] = pos.attacks_from<KING>(pos.square<KING>(Us));
+ attackedBy[Us][PAWN] = pe->pawn_attacks(Us);
+ attackedBy[Us][ALL_PIECES] = attackedBy[Us][KING] | attackedBy[Us][PAWN];
+ attackedBy2[Us] = attackedBy[Us][KING] & attackedBy[Us][PAWN];
- // Increase bonus if supported by pawn, especially if the opponent has
- // no minor piece which can trade with the outpost piece.
- if (bonus && (ei.attackedBy[Us][PAWN] & s))
+ // Init our king safety tables only if we are going to use them
+ if (pos.non_pawn_material(Them) >= RookValueMg + KnightValueMg)
{
- if ( !pos.pieces(Them, KNIGHT)
- && !(squares_of_color(s) & pos.pieces(Them, BISHOP)))
- bonus += bonus + bonus / 2;
- else
- bonus += bonus / 2;
- }
+ kingRing[Us] = attackedBy[Us][KING];
+ if (relative_rank(Us, pos.square<KING>(Us)) == RANK_1)
+ kingRing[Us] |= shift<Up>(kingRing[Us]);
+
+ if (file_of(pos.square<KING>(Us)) == FILE_H)
+ kingRing[Us] |= shift<WEST>(kingRing[Us]);
+
+ else if (file_of(pos.square<KING>(Us)) == FILE_A)
+ kingRing[Us] |= shift<EAST>(kingRing[Us]);
- return make_score(bonus * 2, bonus / 2);
+ kingAttackersCount[Them] = popcount(attackedBy[Us][KING] & pe->pawn_attacks(Them));
+ kingAttacksCount[Them] = kingAttackersWeight[Them] = 0;
+ }
+ else
+ kingRing[Us] = kingAttackersCount[Them] = 0;
}
- // evaluate_pieces() assigns bonuses and penalties to the pieces of a given color
+ // Evaluation::pieces() scores pieces of a given color and type
+ template<Tracing T> template<Color Us, PieceType Pt>
+ Score Evaluation<T>::pieces() {
- template<PieceType Pt, Color Us, bool Trace>
- Score evaluate_pieces(const Position& pos, EvalInfo& ei, Score* mobility, Bitboard* mobilityArea) {
+ constexpr Color Them = (Us == WHITE ? BLACK : WHITE);
+ constexpr Direction Down = (Us == WHITE ? SOUTH : NORTH);
+ constexpr Bitboard OutpostRanks = (Us == WHITE ? Rank4BB | Rank5BB | Rank6BB
+ : Rank5BB | Rank4BB | Rank3BB);
+ const Square* pl = pos.squares<Pt>(Us);
- Bitboard b;
+ Bitboard b, bb;
Square s;
Score score = SCORE_ZERO;
- const PieceType NextPt = (Us == WHITE ? Pt : PieceType(Pt + 1));
- const Color Them = (Us == WHITE ? BLACK : WHITE);
- const Square* pl = pos.list<Pt>(Us);
-
- ei.attackedBy[Us][Pt] = 0;
+ attackedBy[Us][Pt] = 0;
while ((s = *pl++) != SQ_NONE)
{
// 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))
+ 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))
: pos.attacks_from<Pt>(s);
- if (ei.pinnedPieces[Us] & s)
- b &= LineBB[pos.king_square(Us)][s];
+ if (pos.blockers_for_king(Us) & s)
+ b &= LineBB[pos.square<KING>(Us)][s];
- 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];
- Bitboard bb = b & ei.attackedBy[Them][KING];
- if (bb)
- ei.kingAdjacentZoneAttacksCount[Us] += popcount<Max15>(bb);
+ 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]);
-
- int mob = Pt != QUEEN ? popcount<Max15>(b & mobilityArea[Us])
- : popcount<Full >(b & mobilityArea[Us]);
+ int mob = popcount(b & mobilityArea[Us]);
- mobility[Us] += MobilityBonus[Pt][mob];
+ mobility[Us] += MobilityBonus[Pt - 2][mob];
- // Decrease score if we are attacked by an enemy pawn. The remaining part
- // of threat evaluation must be done later when we have full attack info.
- if (ei.attackedBy[Them][PAWN] & s)
- score -= ThreatenedByPawn[Pt];
+ // Penalty if the piece is far from the king
+ score -= KingProtector[Pt - 2] * distance(s, pos.square<KING>(Us));
if (Pt == BISHOP || Pt == KNIGHT)
{
- // Bonus for outpost square
- if (!(pos.pieces(Them, PAWN) & pawn_attack_span(Us, s)))
- score += evaluate_outpost<Pt, Us>(pos, ei, s);
+ // Bonus if piece is on an outpost square or can reach one
+ bb = OutpostRanks & ~pe->pawn_attacks_span(Them);
+ if (bb & s)
+ score += Outpost[Pt == BISHOP][bool(attackedBy[Us][PAWN] & s)] * 2;
+
+ else if (bb &= b & ~pos.pieces(Us))
+ score += Outpost[Pt == BISHOP][bool(attackedBy[Us][PAWN] & bb)];
// Bonus when behind a pawn
if ( relative_rank(Us, s) < RANK_5
&& (pos.pieces(PAWN) & (s + pawn_push(Us))))
score += MinorBehindPawn;
- // Penalty for pawns on same color square of bishop
if (Pt == BISHOP)
- score -= BishopPawns * ei.pi->pawns_on_same_color_squares(Us, s);
+ {
+ // Penalty according to number of pawns on the same color square as the
+ // bishop, bigger when the center files are blocked with pawns.
+ Bitboard blocked = pos.pieces(Us, PAWN) & shift<Down>(pos.pieces());
+
+ score -= BishopPawns * pe->pawns_on_same_color_squares(Us, s)
+ * (1 + popcount(blocked & CenterFiles));
+
+ // Bonus for bishop on a long diagonal which can "see" both center squares
+ if (more_than_one(Center & (attacks_bb<BISHOP>(s, pos.pieces(PAWN)) | s)))
+ 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
&& 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);
+ 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)) ? TrappedBishopA1H1 * 4
- : pos.piece_on(s + d + d) == make_piece(Us, PAWN) ? TrappedBishopA1H1 * 2
- : TrappedBishopA1H1;
+ 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
+ // Bonus for aligning rook with enemy pawns on the same rank/file
if (relative_rank(Us, s) >= RANK_5)
- {
- Bitboard alignedPawns = pos.pieces(Them, PAWN) & PseudoAttacks[ROOK][s];
- if (alignedPawns)
- score += popcount<Max15>(alignedPawns) * RookOnPawn;
- }
+ score += RookOnPawn * popcount(pos.pieces(Them, PAWN) & PseudoAttacks[ROOK][s]);
- // Bonus when on an open or semi-open file
- if (ei.pi->semiopen_file(Us, file_of(s)))
- score += ei.pi->semiopen_file(Them, file_of(s)) ? RookOnOpenFile : RookOnSemiOpenFile;
+ // Bonus for rook on an open or semi-open file
+ if (pe->semiopen_file(Us, file_of(s)))
+ score += RookOnFile[bool(pe->semiopen_file(Them, file_of(s)))];
- // Penalize when trapped by the king, even more if king cannot castle
- if (mob <= 3 && !ei.pi->semiopen_file(Us, file_of(s)))
+ // Penalty when trapped by the king, even more if the king cannot castle
+ else if (mob <= 3)
{
- Square ksq = pos.king_square(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)))
+ File kf = file_of(pos.square<KING>(Us));
+ if ((kf < FILE_E) == (file_of(s) < kf))
score -= (TrappedRook - make_score(mob * 22, 0)) * (1 + !pos.can_castle(Us));
}
}
- }
- if (Trace)
- Tracing::write(Pt, Us, score);
+ if (Pt == QUEEN)
+ {
+ // Penalty if any relative pin or discovered attack against the queen
+ Bitboard queenPinners;
+ if (pos.slider_blockers(pos.pieces(Them, ROOK, BISHOP), s, queenPinners))
+ score -= WeakQueen;
+ }
+ }
+ if (T)
+ Trace::add(Pt, Us, score);
- // Recursively call evaluate_pieces() of next piece type until KING excluded
- return score - evaluate_pieces<NextPt, Them, Trace>(pos, ei, mobility, mobilityArea);
+ return score;
}
- template<>
- Score evaluate_pieces<KING, WHITE, false>(const Position&, EvalInfo&, Score*, Bitboard*) { return SCORE_ZERO; }
- template<>
- Score evaluate_pieces<KING, WHITE, true>(const Position&, EvalInfo&, Score*, Bitboard*) { return SCORE_ZERO; }
-
-
- // evaluate_king() assigns bonuses and penalties to a king of a given color
- template<Color Us, bool Trace>
- Score evaluate_king(const Position& pos, const EvalInfo& ei) {
+ // Evaluation::king() assigns bonuses and penalties to a king of a given color
+ template<Tracing T> template<Color Us>
+ Score Evaluation<T>::king() const {
- const Color Them = (Us == WHITE ? BLACK : WHITE);
+ constexpr Color Them = (Us == WHITE ? BLACK : WHITE);
+ constexpr Bitboard Camp = (Us == WHITE ? AllSquares ^ Rank6BB ^ Rank7BB ^ Rank8BB
+ : AllSquares ^ Rank1BB ^ Rank2BB ^ Rank3BB);
- Bitboard undefended, b, b1, b2, safe;
- int attackUnits;
- const Square ksq = pos.king_square(Us);
+ const Square ksq = pos.square<KING>(Us);
+ Bitboard weak, b, b1, b2, safe, unsafeChecks, pinned;
// King shelter and enemy pawns storm
- Score score = ei.pi->king_safety<Us>(pos, ksq);
+ Score score = pe->king_safety<Us>(pos, ksq);
// Main king safety evaluation
- if (ei.kingAttackersCount[Them])
+ if (kingAttackersCount[Them] > 1 - pos.count<QUEEN>(Them))
{
- // Find the attacked squares around the king which have no defenders
- // apart from the king itself
- undefended = ei.attackedBy[Them][ALL_PIECES]
- & ei.attackedBy[Us][KING]
- & ~( ei.attackedBy[Us][PAWN] | ei.attackedBy[Us][KNIGHT]
- | ei.attackedBy[Us][BISHOP] | ei.attackedBy[Us][ROOK]
- | ei.attackedBy[Us][QUEEN]);
-
- // 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(74, ei.kingAttackersCount[Them] * ei.kingAttackersWeight[Them])
- + 8 * ei.kingAdjacentZoneAttacksCount[Them]
- + 25 * popcount<Max15>(undefended)
- + 11 * (ei.pinnedPieces[Us] != 0)
- - mg_value(score) / 8
- - !pos.count<QUEEN>(Them) * 60;
-
- // 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);
- if (b)
- {
- // ...and then remove squares not supported by another enemy piece
- b &= ei.attackedBy[Them][PAWN] | ei.attackedBy[Them][KNIGHT]
- | ei.attackedBy[Them][BISHOP] | ei.attackedBy[Them][ROOK];
+ int kingDanger = 0;
+ unsafeChecks = 0;
- if (b)
- attackUnits += QueenContactCheck * popcount<Max15>(b);
- }
+ // 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]);
- // Analyse the enemy's safe rook contact checks. Firstly, find the
- // undefended squares around the king reachable by the enemy rooks...
- b = undefended & ei.attackedBy[Them][ROOK] & ~pos.pieces(Them);
+ // Analyse the safe enemy's checks which are possible on next move
+ safe = ~pos.pieces(Them);
+ safe &= ~attackedBy[Us][ALL_PIECES] | (weak & attackedBy2[Them]);
- // Consider only squares where the enemy's rook gives check
- b &= PseudoAttacks[ROOK][ksq];
+ b1 = attacks_bb<ROOK >(ksq, pos.pieces() ^ pos.pieces(Us, QUEEN));
+ b2 = attacks_bb<BISHOP>(ksq, pos.pieces() ^ pos.pieces(Us, QUEEN));
- if (b)
- {
- // ...and then remove squares not supported by another enemy piece
- b &= ( ei.attackedBy[Them][PAWN] | ei.attackedBy[Them][KNIGHT]
- | ei.attackedBy[Them][BISHOP] | ei.attackedBy[Them][QUEEN]);
+ // Enemy queen safe checks
+ if ((b1 | b2) & attackedBy[Them][QUEEN] & safe & ~attackedBy[Us][QUEEN])
+ kingDanger += QueenSafeCheck;
- if (b)
- attackUnits += RookContactCheck * popcount<Max15>(b);
- }
+ b1 &= attackedBy[Them][ROOK];
+ b2 &= attackedBy[Them][BISHOP];
- // Analyse the enemy's safe distance checks for sliders and knights
- safe = ~(ei.attackedBy[Us][ALL_PIECES] | pos.pieces(Them));
+ // Enemy rooks checks
+ if (b1 & safe)
+ kingDanger += RookSafeCheck;
+ else
+ unsafeChecks |= b1;
- b1 = pos.attacks_from<ROOK >(ksq) & safe;
- b2 = pos.attacks_from<BISHOP>(ksq) & safe;
+ // Enemy bishops checks
+ if (b2 & safe)
+ kingDanger += BishopSafeCheck;
+ else
+ unsafeChecks |= b2;
- // Enemy queen safe checks
- b = (b1 | b2) & ei.attackedBy[Them][QUEEN];
- if (b)
- attackUnits += QueenCheck * popcount<Max15>(b);
+ // Enemy knights checks
+ b = pos.attacks_from<KNIGHT>(ksq) & attackedBy[Them][KNIGHT];
+ if (b & safe)
+ kingDanger += KnightSafeCheck;
+ else
+ unsafeChecks |= b;
+
+ // Unsafe or occupied checking squares will also be considered, as long as
+ // the square is in the attacker's mobility area.
+ unsafeChecks &= mobilityArea[Them];
+ pinned = pos.blockers_for_king(Us) & pos.pieces(Us);
+
+ kingDanger += kingAttackersCount[Them] * kingAttackersWeight[Them]
+ + 102 * kingAttacksCount[Them]
+ + 191 * popcount(kingRing[Us] & weak)
+ + 143 * popcount(pinned | unsafeChecks)
+ - 848 * !pos.count<QUEEN>(Them)
+ - 9 * mg_value(score) / 8
+ + 40;
+
+ // Transform the kingDanger units into a Score, and subtract it from the evaluation
+ if (kingDanger > 0)
+ {
+ int mobilityDanger = mg_value(mobility[Them] - mobility[Us]);
+ kingDanger = std::max(0, kingDanger + mobilityDanger);
+ score -= make_score(kingDanger * kingDanger / 4096, kingDanger / 16);
+ }
+ }
- // Enemy rooks safe checks
- b = b1 & ei.attackedBy[Them][ROOK];
- if (b)
- attackUnits += RookCheck * popcount<Max15>(b);
+ Bitboard kf = KingFlank[file_of(ksq)];
- // Enemy bishops safe checks
- b = b2 & ei.attackedBy[Them][BISHOP];
- if (b)
- attackUnits += BishopCheck * popcount<Max15>(b);
+ // Penalty when our king is on a pawnless flank
+ if (!(pos.pieces(PAWN) & kf))
+ score -= PawnlessFlank;
- // Enemy knights safe checks
- b = pos.attacks_from<KNIGHT>(ksq) & ei.attackedBy[Them][KNIGHT] & safe;
- if (b)
- attackUnits += KnightCheck * popcount<Max15>(b);
+ // Find the squares that opponent attacks in our king flank, and the squares
+ // which are attacked twice in that flank but not defended by our pawns.
+ b1 = attackedBy[Them][ALL_PIECES] & kf & Camp;
+ b2 = b1 & attackedBy2[Them] & ~attackedBy[Us][PAWN];
- // Finally, extract the king danger score from the KingDanger[]
- // array and subtract the score from evaluation.
- score -= KingDanger[std::max(std::min(attackUnits, 399), 0)];
- }
+ // King tropism, to anticipate slow motion attacks on our king
+ score -= CloseEnemies * (popcount(b1) + popcount(b2));
- if (Trace)
- Tracing::write(KING, Us, score);
+ if (T)
+ Trace::add(KING, Us, score);
return score;
}
- // evaluate_threats() assigns bonuses according to the type of attacking piece
- // and the type of attacked one.
+ // Evaluation::threats() assigns bonuses according to the types of the
+ // attacking and the attacked pieces.
+ template<Tracing T> template<Color Us>
+ Score Evaluation<T>::threats() const {
- template<Color Us, bool Trace>
- Score evaluate_threats(const Position& pos, const EvalInfo& ei) {
+ constexpr Color Them = (Us == WHITE ? BLACK : WHITE);
+ constexpr Direction Up = (Us == WHITE ? NORTH : SOUTH);
+ constexpr Bitboard TRank3BB = (Us == WHITE ? Rank3BB : Rank6BB);
- 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);
-
- enum { Defended, Weak };
- enum { Minor, Major };
-
- Bitboard b, weak, defended;
+ Bitboard b, weak, defended, nonPawnEnemies, stronglyProtected, safeThreats;
Score score = SCORE_ZERO;
- // Non-pawn enemies defended by a pawn
- defended = (pos.pieces(Them) ^ pos.pieces(Them, PAWN))
- & ei.attackedBy[Them][PAWN];
+ // Non-pawn enemies
+ nonPawnEnemies = pos.pieces(Them) ^ pos.pieces(Them, PAWN);
- // Add a bonus according to the kind of attacking pieces
- if (defended)
- {
- b = defended & (ei.attackedBy[Us][KNIGHT] | ei.attackedBy[Us][BISHOP]);
- while (b)
- score += Threat[Defended][Minor][type_of(pos.piece_on(pop_lsb(&b)))];
+ // 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]);
- b = defended & (ei.attackedBy[Us][ROOK]);
- while (b)
- score += Threat[Defended][Major][type_of(pos.piece_on(pop_lsb(&b)))];
- }
+ // 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
- if (weak)
+ // Bonus according to the kind of attacking pieces
+ if (defended | weak)
{
- b = weak & (ei.attackedBy[Us][KNIGHT] | ei.attackedBy[Us][BISHOP]);
+ b = (defended | weak) & (attackedBy[Us][KNIGHT] | attackedBy[Us][BISHOP]);
while (b)
- score += Threat[Weak][Minor][type_of(pos.piece_on(pop_lsb(&b)))];
+ {
+ Square s = pop_lsb(&b);
+ score += ThreatByMinor[type_of(pos.piece_on(s))];
+ if (type_of(pos.piece_on(s)) != PAWN)
+ score += ThreatByRank * (int)relative_rank(Them, s);
+ }
- b = weak & (ei.attackedBy[Us][ROOK] | ei.attackedBy[Us][QUEEN]);
+ b = (pos.pieces(Them, QUEEN) | weak) & attackedBy[Us][ROOK];
while (b)
- score += Threat[Weak][Major][type_of(pos.piece_on(pop_lsb(&b)))];
+ {
+ Square s = pop_lsb(&b);
+ score += ThreatByRook[type_of(pos.piece_on(s))];
+ if (type_of(pos.piece_on(s)) != PAWN)
+ score += ThreatByRank * (int)relative_rank(Them, s);
+ }
- b = weak & ~ei.attackedBy[Them][ALL_PIECES];
+ b = weak & attackedBy[Us][KING];
if (b)
- score += Hanging * popcount<Max15>(b);
+ score += ThreatByKing[more_than_one(b)];
- b = weak & ei.attackedBy[Us][KING];
- if (b)
- score += more_than_one(b) ? KingOnMany : KingOnOne;
+ score += Hanging * popcount(weak & ~attackedBy[Them][ALL_PIECES]);
+
+ // Bonus for overload (non-pawn enemies attacked and defended exactly once)
+ b = nonPawnEnemies
+ & attackedBy[Us][ALL_PIECES] & ~attackedBy2[Us]
+ & attackedBy[Them][ALL_PIECES] & ~attackedBy2[Them];
+ score += Overload * popcount(b);
}
- // Add a small bonus for safe pawn pushes
- b = pos.pieces(Us, PAWN) & ~TRank7BB;
- b = shift_bb<Up>(b | (shift_bb<Up>(b & TRank2BB) & ~pos.pieces()));
+ // Bonus for enemy unopposed weak pawns
+ if (pos.pieces(Us, ROOK, QUEEN))
+ score += WeakUnopposedPawn * pe->weak_unopposed(Them);
+
+ // Our safe or protected pawns
+ b = pos.pieces(Us, PAWN)
+ & (~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]);
+ safeThreats = pawn_attacks_bb<Us>(b) & nonPawnEnemies;
+ score += ThreatBySafePawn * popcount(safeThreats);
- if (b)
- score += popcount<Full>(b) * PawnSafePush;
+ // 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();
- // Add another bonus if the pawn push attacks an enemy piece
- b = (shift_bb<Left>(b) | shift_bb<Right>(b))
+ // Keep only the squares which are not completely unsafe
+ b &= ~attackedBy[Them][PAWN]
+ & (attackedBy[Us][ALL_PIECES] | ~attackedBy[Them][ALL_PIECES]);
+
+ // Bonus for safe pawn threats on the next move
+ b = pawn_attacks_bb<Us>(b)
& pos.pieces(Them)
- & ~ei.attackedBy[Us][PAWN];
+ & ~attackedBy[Us][PAWN];
- if (b)
- score += popcount<Max15>(b) * PawnAttackThreat;
+ score += ThreatByPawnPush * popcount(b);
- if (Trace)
- Tracing::write(Tracing::THREAT, Us, score);
+ // Bonus for threats on the next moves against enemy queen
+ if (pos.count<QUEEN>(Them) == 1)
+ {
+ Square s = pos.square<QUEEN>(Them);
+ safeThreats = mobilityArea[Us] & ~stronglyProtected;
+
+ b = attackedBy[Us][KNIGHT] & pos.attacks_from<KNIGHT>(s);
+
+ score += KnightOnQueen * popcount(b & safeThreats);
+
+ b = (attackedBy[Us][BISHOP] & pos.attacks_from<BISHOP>(s))
+ | (attackedBy[Us][ROOK ] & pos.attacks_from<ROOK >(s));
+
+ score += SliderOnQueen * popcount(b & safeThreats & attackedBy2[Us]);
+ }
+
+ // Connectivity: ensure that knights, bishops, rooks, and queens are protected
+ b = (pos.pieces(Us) ^ pos.pieces(Us, PAWN, KING)) & attackedBy[Us][ALL_PIECES];
+ score += Connectivity * popcount(b);
+
+ 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 Trace>
- Score evaluate_passed_pawns(const Position& pos, const EvalInfo& ei) {
+ constexpr Color Them = (Us == WHITE ? BLACK : WHITE);
+ constexpr Direction Up = (Us == WHITE ? NORTH : SOUTH);
- 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, defendedSquares, unsafeSquares;
Score score = SCORE_ZERO;
- b = ei.pi->passed_pawns(Us);
+ b = pe->passed_pawns(Us);
while (b)
{
Square s = pop_lsb(&b);
- assert(pos.pawn_passed(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);
+ bb = forward_file_bb(Us, s) & (attackedBy[Them][ALL_PIECES] | pos.pieces(Them));
+ score -= HinderPassedPawn * popcount(bb);
- // Base bonus based on rank
- Value mbonus = Value(17 * rr), ebonus = Value(7 * (rr + r + 1));
+ int r = relative_rank(Us, s);
+ int w = PassedDanger[r];
- if (rr)
+ Score bonus = PassedRank[r];
+
+ if (w)
{
- Square blockSq = s + pawn_push(Us);
+ Square blockSq = s + Up;
// Adjust bonus based on the king's proximity
- ebonus += distance(pos.king_square(Them), blockSq) * 5 * rr
- - distance(pos.king_square(Us ), blockSq) * 2 * rr;
+ bonus += make_score(0, ( king_proximity(Them, blockSq) * 5
+ - 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.king_square(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);
+ defendedSquares = unsafeSquares = squaresToQueen = forward_file_bb(Us, s);
- Bitboard bb = forward_bb(Them, s) & pos.pieces(ROOK, QUEEN) & pos.attacks_from<ROOK>(s);
+ bb = forward_file_bb(Them, s) & pos.pieces(ROOK, QUEEN) & pos.attacks_from<ROOK>(s);
if (!(pos.pieces(Us) & bb))
- defendedSquares &= ei.attackedBy[Us][ALL_PIECES];
+ defendedSquares &= attackedBy[Us][ALL_PIECES];
if (!(pos.pieces(Them) & bb))
- unsafeSquares &= ei.attackedBy[Them][ALL_PIECES] | pos.pieces(Them);
+ unsafeSquares &= attackedBy[Them][ALL_PIECES] | pos.pieces(Them);
// 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 ? 15 : !(unsafeSquares & blockSq) ? 9 : 0;
+ int k = !unsafeSquares ? 20 : !(unsafeSquares & blockSq) ? 9 : 0;
- // If the path to queen is fully defended, assign a big bonus.
+ // 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;
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 * 3 + r * 2 + 3, ebonus += rr + r * 2;
- } // rr != 0
+ bonus += make_score(w + r * 2, w + r * 2);
+ } // w != 0
- if (pos.count<PAWN>(Us) < pos.count<PAWN>(Them))
- ebonus += ebonus / 4;
+ // Scale down bonus for candidate passers which need more than one
+ // pawn push to become passed, or have a pawn in front of them.
+ if ( !pos.pawn_passed(Us, s + Up)
+ || (pos.pieces(PAWN) & forward_file_bb(Us, s)))
+ bonus = bonus / 2;
- score += make_score(mbonus, ebonus);
+ score += bonus + PassedFile[file_of(s)];
}
- if (Trace)
- Tracing::write(Tracing::PASSED, Us, apply_weight(score, Weights[PassedPawns]));
+ if (T)
+ Trace::add(PASSED, Us, score);
- // Add the scores to the middlegame and endgame eval
- return apply_weight(score, Weights[PassedPawns]);
+ return score;
}
- // evaluate_space() computes the space evaluation for a given side. The
+ // Evaluation::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) {
- const Color Them = (Us == WHITE ? BLACK : WHITE);
+ template<Tracing T> template<Color Us>
+ Score Evaluation<T>::space() const {
- // 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.
- Bitboard safe = SpaceMask[Us]
+ constexpr Color Them = (Us == WHITE ? BLACK : WHITE);
+ constexpr Bitboard SpaceMask =
+ Us == WHITE ? CenterFiles & (Rank2BB | Rank3BB | Rank4BB)
+ : CenterFiles & (Rank7BB | Rank6BB | Rank5BB);
+
+ if (pos.non_pawn_material() < SpaceThreshold)
+ return SCORE_ZERO;
+
+ // 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);
- // Since SpaceMask[Us] is fully on our half of the board
- assert(unsigned(safe >> (Us == WHITE ? 32 : 0)) == 0);
-
- // Count safe + (behind & safe) with a single popcount
- int bonus = popcount<Full>((Us == WHITE ? safe << 32 : safe >> 32) | (behind & safe));
- int weight = pos.count<KNIGHT>(Us) + pos.count<BISHOP>(Us)
- + pos.count<KNIGHT>(Them) + pos.count<BISHOP>(Them);
-
- return make_score(bonus * weight * weight, 0);
- }
+ int bonus = popcount(safe) + popcount(behind & safe);
+ int weight = pos.count<ALL_PIECES>(Us) - 2 * pe->open_files();
+ Score score = make_score(bonus * weight * weight / 16, 0);
- // do_evaluate() is the evaluation entry point, called directly from evaluate()
-
- template<bool Trace>
- Value do_evaluate(const Position& pos) {
-
- assert(!pos.checkers());
-
- EvalInfo ei;
- Score score, mobility[2] = { SCORE_ZERO, SCORE_ZERO };
+ if (T)
+ Trace::add(SPACE, Us, score);
- // Initialize score by reading the incrementally updated scores included
- // in the position object (material + piece square tables).
- // Score is computed from the point of view of white.
- score = pos.psq_score();
+ return score;
+ }
- // Probe the material hash table
- ei.mi = Material::probe(pos);
- score += ei.mi->imbalance();
- // If we have a specialized evaluation function for the current material
- // configuration, call it and return.
- if (ei.mi->specialized_eval_exists())
- return ei.mi->evaluate(pos);
+ // Evaluation::initiative() computes the initiative correction value
+ // for the position. It is a second order bonus/malus based on the
+ // known attacking/defending status of the players.
- // Probe the pawn hash table
- ei.pi = Pawns::probe(pos);
- score += apply_weight(ei.pi->pawns_score(), Weights[PawnStructure]);
+ template<Tracing T>
+ Score Evaluation<T>::initiative(Value eg) const {
- // Initialize attack and king safety bitboards
- init_eval_info<WHITE>(pos, ei);
- init_eval_info<BLACK>(pos, ei);
+ int outflanking = distance<File>(pos.square<KING>(WHITE), pos.square<KING>(BLACK))
+ - distance<Rank>(pos.square<KING>(WHITE), pos.square<KING>(BLACK));
- ei.attackedBy[WHITE][ALL_PIECES] |= ei.attackedBy[WHITE][KING];
- ei.attackedBy[BLACK][ALL_PIECES] |= ei.attackedBy[BLACK][KING];
+ bool pawnsOnBothFlanks = (pos.pieces(PAWN) & QueenSide)
+ && (pos.pieces(PAWN) & KingSide);
- // Do not include in mobility squares protected by enemy pawns or occupied by our pawns or king
- Bitboard mobilityArea[] = { ~(ei.attackedBy[BLACK][PAWN] | pos.pieces(WHITE, PAWN, KING)),
- ~(ei.attackedBy[WHITE][PAWN] | pos.pieces(BLACK, PAWN, KING)) };
+ // Compute the initiative bonus for the attacking side
+ int complexity = 8 * outflanking
+ + 8 * pe->pawn_asymmetry()
+ + 12 * pos.count<PAWN>()
+ + 16 * pawnsOnBothFlanks
+ + 48 * !pos.non_pawn_material()
+ -136 ;
- // Evaluate pieces and mobility
- score += evaluate_pieces<KNIGHT, WHITE, Trace>(pos, ei, mobility, mobilityArea);
- score += apply_weight(mobility[WHITE] - mobility[BLACK], Weights[Mobility]);
+ // 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 change sign after the bonus.
+ int v = ((eg > 0) - (eg < 0)) * std::max(complexity, -abs(eg));
- // Evaluate kings after all other pieces because we need complete attack
- // information when computing the king safety evaluation.
- score += evaluate_king<WHITE, Trace>(pos, ei)
- - evaluate_king<BLACK, Trace>(pos, ei);
+ if (T)
+ Trace::add(INITIATIVE, make_score(0, v));
- // Evaluate tactical threats, we need full attack information including king
- score += evaluate_threats<WHITE, Trace>(pos, ei)
- - evaluate_threats<BLACK, Trace>(pos, ei);
+ return make_score(0, v);
+ }
- // Evaluate passed pawns, we need full attack information including king
- score += evaluate_passed_pawns<WHITE, Trace>(pos, ei)
- - evaluate_passed_pawns<BLACK, Trace>(pos, ei);
- // 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 += int(relative_rank(WHITE, frontmost_sq(WHITE, b))) * Unstoppable;
+ // Evaluation::scale_factor() computes the scale factor for the winning side
- if ((b = ei.pi->passed_pawns(BLACK)) != 0)
- score -= int(relative_rank(BLACK, frontmost_sq(BLACK, b))) * Unstoppable;
- }
+ template<Tracing T>
+ ScaleFactor Evaluation<T>::scale_factor(Value eg) const {
- // Evaluate space for both sides, only during opening
- if (pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK) >= 2 * QueenValueMg + 4 * RookValueMg + 2 * KnightValueMg)
- {
- Score s = evaluate_space<WHITE>(pos, ei) - evaluate_space<BLACK>(pos, ei);
- score += apply_weight(s, Weights[Space]);
- }
-
- // Scale winning side if position is more drawish than it appears
- Color strongSide = eg_value(score) > VALUE_DRAW ? WHITE : BLACK;
- ScaleFactor sf = ei.mi->scale_factor(pos, strongSide);
+ Color strongSide = eg > VALUE_DRAW ? WHITE : BLACK;
+ 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.mi->game_phase() < PHASE_MIDGAME
- && (sf == SCALE_FACTOR_NORMAL || sf == SCALE_FACTOR_ONEPAWN))
+ // If scale is not already specific, scale down the endgame 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 is even more a draw.
+ // Endgame with opposite-colored bishops and no other pieces is almost a draw
if ( pos.non_pawn_material(WHITE) == BishopValueMg
&& pos.non_pawn_material(BLACK) == BishopValueMg)
- sf = more_than_one(pos.pieces(PAWN)) ? ScaleFactor(32) : ScaleFactor(8);
+ sf = 31;
// Endgame with opposite-colored bishops, but also other pieces. Still
// a bit drawish, but not as drawish as with only the two bishops.
else
- sf = ScaleFactor(50 * sf / SCALE_FACTOR_NORMAL);
+ sf = 46;
}
- // Endings where weaker side can place his king in front of the opponent's
- // pawns are drawish.
- else if ( abs(eg_value(score)) <= BishopValueEg
- && ei.pi->pawn_span(strongSide) <= 1
- && !pos.pawn_passed(~strongSide, pos.king_square(~strongSide)))
- sf = ei.pi->pawn_span(strongSide) ? ScaleFactor(56) : ScaleFactor(38);
+ else
+ sf = std::min(40 + 7 * pos.count<PAWN>(strongSide), sf);
}
- // Interpolate between a middlegame and a (scaled by 'sf') endgame score
- Value v = mg_value(score) * int(ei.mi->game_phase())
- + eg_value(score) * int(PHASE_MIDGAME - ei.mi->game_phase()) * sf / SCALE_FACTOR_NORMAL;
+ return ScaleFactor(sf);
+ }
- v /= int(PHASE_MIDGAME);
- // In case of tracing add all single evaluation contributions for both white and black
- if (Trace)
- {
- Tracing::write(Tracing::MATERIAL, pos.psq_score());
- Tracing::write(Tracing::IMBALANCE, ei.mi->imbalance());
- Tracing::write(PAWN, ei.pi->pawns_score());
- Tracing::write(Tracing::MOBILITY, apply_weight(mobility[WHITE], Weights[Mobility])
- , apply_weight(mobility[BLACK], Weights[Mobility]));
- Tracing::write(Tracing::SPACE, apply_weight(evaluate_space<WHITE>(pos, ei), Weights[Space])
- , apply_weight(evaluate_space<BLACK>(pos, ei), Weights[Space]));
- Tracing::write(Tracing::TOTAL, score);
- Tracing::ei = ei;
- Tracing::sf = sf;
- }
+ // 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.
- return (pos.side_to_move() == WHITE ? v : -v) + Eval::Tempo;
- }
+ template<Tracing T>
+ Value Evaluation<T>::value() {
+ assert(!pos.checkers());
- // Tracing function definitions
+ // Probe the material hash table
+ me = Material::probe(pos);
- double Tracing::to_cp(Value v) { return double(v) / PawnValueEg; }
+ // 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);
- void Tracing::write(int idx, Color c, Score s) { scores[c][idx] = s; }
+ // 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;
- void Tracing::write(int idx, Score w, Score b) {
+ // Probe the pawn hash table
+ pe = Pawns::probe(pos);
+ score += pe->pawn_score(WHITE) - pe->pawn_score(BLACK);
- write(idx, WHITE, w);
- write(idx, BLACK, b);
- }
+ // Early exit if score is high
+ Value v = (mg_value(score) + eg_value(score)) / 2;
+ if (abs(v) > LazyThreshold)
+ return pos.side_to_move() == WHITE ? v : -v;
- void Tracing::print(std::stringstream& ss, const char* name, int idx) {
-
- Score wScore = scores[WHITE][idx];
- Score bScore = scores[BLACK][idx];
-
- switch (idx) {
- case MATERIAL: case IMBALANCE: case PAWN: case TOTAL:
- ss << std::setw(15) << name << " | --- --- | --- --- | "
- << std::setw(5) << to_cp(mg_value(wScore - bScore)) << " "
- << std::setw(5) << to_cp(eg_value(wScore - bScore)) << " \n";
- break;
- default:
- ss << std::setw(15) << name << " | " << std::noshowpos
- << std::setw(5) << to_cp(mg_value(wScore)) << " "
- << std::setw(5) << to_cp(eg_value(wScore)) << " | "
- << std::setw(5) << to_cp(mg_value(bScore)) << " "
- << std::setw(5) << to_cp(eg_value(bScore)) << " | "
- << std::setw(5) << to_cp(mg_value(wScore - bScore)) << " "
- << std::setw(5) << to_cp(eg_value(wScore - bScore)) << " \n";
- }
- }
+ // Main evaluation begins here
- std::string Tracing::do_trace(const Position& pos) {
+ initialize<WHITE>();
+ initialize<BLACK>();
- std::memset(scores, 0, sizeof(scores));
+ // Pieces should be evaluated first (populate attack tables)
+ 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 >();
- Value v = do_evaluate<true>(pos);
- v = pos.side_to_move() == WHITE ? v : -v; // White's point of view
+ score += mobility[WHITE] - mobility[BLACK];
- 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";
+ score += king< WHITE>() - king< BLACK>()
+ + threats<WHITE>() - threats<BLACK>()
+ + passed< WHITE>() - passed< BLACK>()
+ + space< WHITE>() - space< BLACK>();
- print(ss, "Material", MATERIAL);
- print(ss, "Imbalance", IMBALANCE);
- print(ss, "Pawns", PAWN);
- print(ss, "Knights", KNIGHT);
- print(ss, "Bishops", BISHOP);
- print(ss, "Rooks", ROOK);
- print(ss, "Queens", QUEEN);
- print(ss, "Mobility", MOBILITY);
- print(ss, "King safety", KING);
- print(ss, "Threats", THREAT);
- print(ss, "Passed pawns", PASSED);
- print(ss, "Space", SPACE);
+ score += initiative(eg_value(score));
- ss << "----------------+-------------+-------------+-------------\n";
- print(ss, "Total", TOTAL);
+ // Interpolate between a middlegame and a (scaled by 'sf') endgame score
+ ScaleFactor sf = scale_factor(eg_value(score));
+ v = mg_value(score) * int(me->game_phase())
+ + eg_value(score) * int(PHASE_MIDGAME - me->game_phase()) * sf / SCALE_FACTOR_NORMAL;
- ss << "\nTotal Evaluation: " << to_cp(v) << " (white side)\n";
+ v /= int(PHASE_MIDGAME);
- return ss.str();
+ // 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]);
+ Trace::add(TOTAL, score);
+ }
+
+ return (pos.side_to_move() == WHITE ? v : -v) // Side to move point of view
+ + Eval::Tempo;
}
} // namespace
-namespace Eval {
+/// 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.
- /// evaluate() is the main evaluation function. It returns a static evaluation
- /// of the position always from the point of view of the side to move.
+Value Eval::evaluate(const Position& pos) {
+ return Evaluation<NO_TRACE>(pos).value();
+}
- Value evaluate(const Position& pos) {
- return do_evaluate<false>(pos);
- }
+/// 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() 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. It's mainly used for
- /// debugging.
- std::string trace(const Position& pos) {
- return Tracing::do_trace(pos);
- }
+std::string Eval::trace(const Position& pos) {
+ std::memset(scores, 0, sizeof(scores));
- /// init() computes evaluation weights, usually at startup
+ pos.this_thread()->contempt = SCORE_ZERO; // Reset any dynamic contempt
- void init() {
+ Value v = Evaluation<TRACE>(pos).value();
- const int MaxSlope = 8700;
- const int Peak = 1280000;
- int t = 0;
+ v = pos.side_to_move() == WHITE ? v : -v; // Trace scores are from white's point of view
- for (int i = 0; i < 400; ++i)
- {
- t = std::min(Peak, std::min(i * i * 27, t + MaxSlope));
- KingDanger[i] = apply_weight(make_score(t / 1000, 0), Weights[KingSafety]);
- }
- }
+ std::stringstream ss;
+ 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)
+ << " Initiative | " << Term(INITIATIVE)
+ << " 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)
+ << " ------------+-------------+-------------+------------\n"
+ << " Total | " << Term(TOTAL);
+
+ ss << "\nTotal evaluation: " << to_cp(v) << " (white side)\n";
-} // namespace Eval
+ return ss.str();
+}