2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2013 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
30 #include "ucioption.h"
34 enum ExtendedPieceType { // Used for tracing
35 PST = 8, IMBALANCE, MOBILITY, THREAT, PASSED, UNSTOPPABLE, SPACE, TOTAL
40 Score scores[COLOR_NB][TOTAL + 1];
41 std::stringstream stream;
43 void add(int idx, Score term_w, Score term_b = SCORE_ZERO);
44 void row(const char* name, int idx);
45 std::string do_trace(const Position& pos);
48 // Struct EvalInfo contains various information computed and collected
49 // by the evaluation functions.
52 // Pointers to material and pawn hash table entries
56 // attackedBy[color][piece type] is a bitboard representing all squares
57 // attacked by a given color and piece type, attackedBy[color][ALL_PIECES]
58 // contains all squares attacked by the given color.
59 Bitboard attackedBy[COLOR_NB][PIECE_TYPE_NB];
61 // kingRing[color] is the zone around the king which is considered
62 // by the king safety evaluation. This consists of the squares directly
63 // adjacent to the king, and the three (or two, for a king on an edge file)
64 // squares two ranks in front of the king. For instance, if black's king
65 // is on g8, kingRing[BLACK] is a bitboard containing the squares f8, h8,
66 // f7, g7, h7, f6, g6 and h6.
67 Bitboard kingRing[COLOR_NB];
69 // kingAttackersCount[color] is the number of pieces of the given color
70 // which attack a square in the kingRing of the enemy king.
71 int kingAttackersCount[COLOR_NB];
73 // kingAttackersWeight[color] is the sum of the "weight" of the pieces of the
74 // given color which attack a square in the kingRing of the enemy king. The
75 // weights of the individual piece types are given by the variables
76 // QueenAttackWeight, RookAttackWeight, BishopAttackWeight and
77 // KnightAttackWeight in evaluate.cpp
78 int kingAttackersWeight[COLOR_NB];
80 // kingAdjacentZoneAttacksCount[color] is the number of attacks to squares
81 // directly adjacent to the king of the given color. Pieces which attack
82 // more than one square are counted multiple times. For instance, if black's
83 // king is on g8 and there's a white knight on g5, this knight adds
84 // 2 to kingAdjacentZoneAttacksCount[BLACK].
85 int kingAdjacentZoneAttacksCount[COLOR_NB];
88 // Evaluation grain size, must be a power of 2
89 const int GrainSize = 4;
91 // Evaluation weights, initialized from UCI options
92 enum { Mobility, PawnStructure, PassedPawns, Space, KingDangerUs, KingDangerThem };
96 #define S(mg, eg) make_score(mg, eg)
98 // Internal evaluation weights. These are applied on top of the evaluation
99 // weights read from UCI parameters. The purpose is to be able to change
100 // the evaluation weights while keeping the default values of the UCI
101 // parameters at 100, which looks prettier.
103 // Values modified by Joona Kiiski
104 const Score WeightsInternal[] = {
105 S(289, 344), S(233, 201), S(221, 273), S(46, 0), S(271, 0), S(307, 0)
108 // MobilityBonus[PieceType][attacked] contains bonuses for middle and end
109 // game, indexed by piece type and number of attacked squares not occupied by
111 const Score MobilityBonus[][32] = {
113 { S(-35,-30), S(-22,-20), S(-9,-10), S( 3, 0), S(15, 10), S(27, 20), // Knights
114 S( 37, 28), S( 42, 31), S(44, 33) },
115 { S(-22,-27), S( -8,-13), S( 6, 1), S(20, 15), S(34, 29), S(48, 43), // Bishops
116 S( 60, 55), S( 68, 63), S(74, 68), S(77, 72), S(80, 75), S(82, 77),
117 S( 84, 79), S( 86, 81), S(87, 82), S(87, 82) },
118 { S(-17,-33), S(-11,-16), S(-5, 0), S( 1, 16), S( 7, 32), S(13, 48), // Rooks
119 S( 18, 64), S( 22, 80), S(26, 96), S(29,109), S(31,115), S(33,119),
120 S( 35,122), S( 36,123), S(37,124), S(38,124) },
121 { S(-12,-20), S( -8,-13), S(-5, -7), S(-2, -1), S( 1, 5), S( 4, 11), // Queens
122 S( 7, 17), S( 10, 23), S(13, 29), S(16, 34), S(18, 38), S(20, 40),
123 S( 22, 41), S( 23, 41), S(24, 41), S(25, 41), S(25, 41), S(25, 41),
124 S( 25, 41), S( 25, 41), S(25, 41), S(25, 41), S(25, 41), S(25, 41),
125 S( 25, 41), S( 25, 41), S(25, 41), S(25, 41), S(25, 41), S(25, 41),
126 S( 25, 41), S( 25, 41) }
129 // Outpost[PieceType][Square] contains bonuses of knights and bishops, indexed
130 // by piece type and square (from white's point of view).
131 const Value Outpost[][SQUARE_NB] = {
134 V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // Knights
135 V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0),
136 V(0), V(0), V(4), V(8), V(8), V(4), V(0), V(0),
137 V(0), V(4),V(17),V(26),V(26),V(17), V(4), V(0),
138 V(0), V(8),V(26),V(35),V(35),V(26), V(8), V(0),
139 V(0), V(4),V(17),V(17),V(17),V(17), V(4), V(0) },
141 V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // Bishops
142 V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0),
143 V(0), V(0), V(5), V(5), V(5), V(5), V(0), V(0),
144 V(0), V(5),V(10),V(10),V(10),V(10), V(5), V(0),
145 V(0),V(10),V(21),V(21),V(21),V(21),V(10), V(0),
146 V(0), V(5), V(8), V(8), V(8), V(8), V(5), V(0) }
149 // Threat[attacking][attacked] contains bonuses according to which piece
150 // type attacks which one.
151 const Score Threat[][PIECE_TYPE_NB] = {
153 { S(0, 0), S( 7, 39), S( 0, 0), S(24, 49), S(41,100), S(41,100) }, // KNIGHT
154 { S(0, 0), S( 7, 39), S(24, 49), S( 0, 0), S(41,100), S(41,100) }, // BISHOP
155 { S(0, 0), S( 0, 22), S(15, 49), S(15, 49), S( 0, 0), S(24, 49) }, // ROOK
156 { S(0, 0), S(15, 39), S(15, 39), S(15, 39), S(15, 39), S( 0, 0) } // QUEEN
159 // ThreatenedByPawn[PieceType] contains a penalty according to which piece
160 // type is attacked by an enemy pawn.
161 const Score ThreatenedByPawn[] = {
162 S(0, 0), S(0, 0), S(56, 70), S(56, 70), S(76, 99), S(86, 118)
167 const Score Tempo = make_score(24, 11);
168 const Score BishopPin = make_score(66, 11);
169 const Score RookOn7th = make_score(11, 20);
170 const Score QueenOn7th = make_score( 3, 8);
171 const Score RookOnPawn = make_score(10, 28);
172 const Score QueenOnPawn = make_score( 4, 20);
173 const Score RookOpenFile = make_score(43, 21);
174 const Score RookSemiopenFile = make_score(19, 10);
175 const Score BishopPawns = make_score( 8, 12);
176 const Score UndefendedMinor = make_score(25, 10);
177 const Score TrappedRook = make_score(90, 0);
179 // Penalty for a bishop on a1/h1 (a8/h8 for black) which is trapped by
180 // a friendly pawn on b2/g2 (b7/g7 for black). This can obviously only
181 // happen in Chess960 games.
182 const Score TrappedBishopA1H1 = make_score(50, 50);
184 // The SpaceMask[Color] contains the area of the board which is considered
185 // by the space evaluation. In the middle game, each side is given a bonus
186 // based on how many squares inside this area are safe and available for
187 // friendly minor pieces.
188 const Bitboard SpaceMask[] = {
189 (1ULL << SQ_C2) | (1ULL << SQ_D2) | (1ULL << SQ_E2) | (1ULL << SQ_F2) |
190 (1ULL << SQ_C3) | (1ULL << SQ_D3) | (1ULL << SQ_E3) | (1ULL << SQ_F3) |
191 (1ULL << SQ_C4) | (1ULL << SQ_D4) | (1ULL << SQ_E4) | (1ULL << SQ_F4),
192 (1ULL << SQ_C7) | (1ULL << SQ_D7) | (1ULL << SQ_E7) | (1ULL << SQ_F7) |
193 (1ULL << SQ_C6) | (1ULL << SQ_D6) | (1ULL << SQ_E6) | (1ULL << SQ_F6) |
194 (1ULL << SQ_C5) | (1ULL << SQ_D5) | (1ULL << SQ_E5) | (1ULL << SQ_F5)
197 // King danger constants and variables. The king danger scores are taken
198 // from the KingDanger[]. Various little "meta-bonuses" measuring
199 // the strength of the enemy attack are added up into an integer, which
200 // is used as an index to KingDanger[].
202 // KingAttackWeights[PieceType] contains king attack weights by piece type
203 const int KingAttackWeights[] = { 0, 0, 2, 2, 3, 5 };
205 // Bonuses for enemy's safe checks
206 const int QueenContactCheck = 6;
207 const int RookContactCheck = 4;
208 const int QueenCheck = 3;
209 const int RookCheck = 2;
210 const int BishopCheck = 1;
211 const int KnightCheck = 1;
213 // KingExposed[Square] contains penalties based on the position of the
214 // defending king, indexed by king's square (from white's point of view).
215 const int KingExposed[] = {
216 2, 0, 2, 5, 5, 2, 0, 2,
217 2, 2, 4, 8, 8, 4, 2, 2,
218 7, 10, 12, 12, 12, 12, 10, 7,
219 15, 15, 15, 15, 15, 15, 15, 15,
220 15, 15, 15, 15, 15, 15, 15, 15,
221 15, 15, 15, 15, 15, 15, 15, 15,
222 15, 15, 15, 15, 15, 15, 15, 15,
223 15, 15, 15, 15, 15, 15, 15, 15
226 // KingDanger[Color][attackUnits] contains the actual king danger weighted
227 // scores, indexed by color and by a calculated integer number.
228 Score KingDanger[COLOR_NB][128];
230 // Function prototypes
232 Value do_evaluate(const Position& pos, Value& margin);
235 void init_eval_info(const Position& pos, EvalInfo& ei);
237 template<Color Us, bool Trace>
238 Score evaluate_pieces_of_color(const Position& pos, EvalInfo& ei, Score& mobility);
240 template<Color Us, bool Trace>
241 Score evaluate_king(const Position& pos, EvalInfo& ei, Value margins[]);
243 template<Color Us, bool Trace>
244 Score evaluate_threats(const Position& pos, EvalInfo& ei);
246 template<Color Us, bool Trace>
247 Score evaluate_passed_pawns(const Position& pos, EvalInfo& ei);
250 int evaluate_space(const Position& pos, EvalInfo& ei);
252 Score evaluate_unstoppable_pawns(const Position& pos, EvalInfo& ei);
254 Value interpolate(const Score& v, Phase ph, ScaleFactor sf);
255 Score apply_weight(Score v, Score w);
256 Score weight_option(const std::string& mgOpt, const std::string& egOpt, Score internalWeight);
257 double to_cp(Value v);
263 /// evaluate() is the main evaluation function. It always computes two
264 /// values, an endgame score and a middle game score, and interpolates
265 /// between them based on the remaining material.
267 Value evaluate(const Position& pos, Value& margin) {
268 return do_evaluate<false>(pos, margin);
272 /// trace() is like evaluate() but instead of a value returns a string suitable
273 /// to be print on stdout with the detailed descriptions and values of each
274 /// evaluation term. Used mainly for debugging.
275 std::string trace(const Position& pos) {
276 return Tracing::do_trace(pos);
280 /// init() computes evaluation weights from the corresponding UCI parameters
281 /// and setup king tables.
285 Weights[Mobility] = weight_option("Mobility (Midgame)", "Mobility (Endgame)", WeightsInternal[Mobility]);
286 Weights[PawnStructure] = weight_option("Pawn Structure (Midgame)", "Pawn Structure (Endgame)", WeightsInternal[PawnStructure]);
287 Weights[PassedPawns] = weight_option("Passed Pawns (Midgame)", "Passed Pawns (Endgame)", WeightsInternal[PassedPawns]);
288 Weights[Space] = weight_option("Space", "Space", WeightsInternal[Space]);
289 Weights[KingDangerUs] = weight_option("Cowardice", "Cowardice", WeightsInternal[KingDangerUs]);
290 Weights[KingDangerThem] = weight_option("Aggressiveness", "Aggressiveness", WeightsInternal[KingDangerThem]);
292 const int MaxSlope = 30;
293 const int Peak = 1280;
295 for (int t = 0, i = 1; i < 100; i++)
297 t = std::min(Peak, std::min(int(0.4 * i * i), t + MaxSlope));
299 KingDanger[1][i] = apply_weight(make_score(t, 0), Weights[KingDangerUs]);
300 KingDanger[0][i] = apply_weight(make_score(t, 0), Weights[KingDangerThem]);
310 Value do_evaluate(const Position& pos, Value& margin) {
312 assert(!pos.checkers());
315 Value margins[COLOR_NB];
316 Score score, mobilityWhite, mobilityBlack;
317 Thread* th = pos.this_thread();
319 // margins[] store the uncertainty estimation of position's evaluation
320 // that typically is used by the search for pruning decisions.
321 margins[WHITE] = margins[BLACK] = VALUE_ZERO;
323 // Initialize score by reading the incrementally updated scores included
324 // in the position object (material + piece square tables) and adding
325 // Tempo bonus. Score is computed from the point of view of white.
326 score = pos.psq_score() + (pos.side_to_move() == WHITE ? Tempo : -Tempo);
328 // Probe the material hash table
329 ei.mi = Material::probe(pos, th->materialTable, th->endgames);
330 score += ei.mi->material_value();
332 // If we have a specialized evaluation function for the current material
333 // configuration, call it and return.
334 if (ei.mi->specialized_eval_exists())
337 return ei.mi->evaluate(pos);
340 // Probe the pawn hash table
341 ei.pi = Pawns::probe(pos, th->pawnsTable);
342 score += apply_weight(ei.pi->pawns_value(), Weights[PawnStructure]);
344 // Initialize attack and king safety bitboards
345 init_eval_info<WHITE>(pos, ei);
346 init_eval_info<BLACK>(pos, ei);
348 // Evaluate pieces and mobility
349 score += evaluate_pieces_of_color<WHITE, Trace>(pos, ei, mobilityWhite)
350 - evaluate_pieces_of_color<BLACK, Trace>(pos, ei, mobilityBlack);
352 score += apply_weight(mobilityWhite - mobilityBlack, Weights[Mobility]);
354 // Evaluate kings after all other pieces because we need complete attack
355 // information when computing the king safety evaluation.
356 score += evaluate_king<WHITE, Trace>(pos, ei, margins)
357 - evaluate_king<BLACK, Trace>(pos, ei, margins);
359 // Evaluate tactical threats, we need full attack information including king
360 score += evaluate_threats<WHITE, Trace>(pos, ei)
361 - evaluate_threats<BLACK, Trace>(pos, ei);
363 // Evaluate passed pawns, we need full attack information including king
364 score += evaluate_passed_pawns<WHITE, Trace>(pos, ei)
365 - evaluate_passed_pawns<BLACK, Trace>(pos, ei);
367 // If one side has only a king, check whether exists any unstoppable passed pawn
368 if (!pos.non_pawn_material(WHITE) || !pos.non_pawn_material(BLACK))
369 score += evaluate_unstoppable_pawns(pos, ei);
371 // Evaluate space for both sides, only in middle-game.
372 if (ei.mi->space_weight())
374 int s = evaluate_space<WHITE>(pos, ei) - evaluate_space<BLACK>(pos, ei);
375 score += apply_weight(make_score(s * ei.mi->space_weight(), 0), Weights[Space]);
378 // Scale winning side if position is more drawish that what it appears
379 ScaleFactor sf = eg_value(score) > VALUE_DRAW ? ei.mi->scale_factor(pos, WHITE)
380 : ei.mi->scale_factor(pos, BLACK);
382 // If we don't already have an unusual scale factor, check for opposite
383 // colored bishop endgames, and use a lower scale for those.
384 if ( ei.mi->game_phase() < PHASE_MIDGAME
385 && pos.opposite_bishops()
386 && sf == SCALE_FACTOR_NORMAL)
388 // Only the two bishops ?
389 if ( pos.non_pawn_material(WHITE) == BishopValueMg
390 && pos.non_pawn_material(BLACK) == BishopValueMg)
392 // Check for KBP vs KB with only a single pawn that is almost
393 // certainly a draw or at least two pawns.
394 bool one_pawn = (pos.piece_count(WHITE, PAWN) + pos.piece_count(BLACK, PAWN) == 1);
395 sf = one_pawn ? ScaleFactor(8) : ScaleFactor(32);
398 // Endgame with opposite-colored bishops, but also other pieces. Still
399 // a bit drawish, but not as drawish as with only the two bishops.
400 sf = ScaleFactor(50);
403 margin = margins[pos.side_to_move()];
404 Value v = interpolate(score, ei.mi->game_phase(), sf);
406 // In case of tracing add all single evaluation contributions for both white and black
409 Tracing::add(PST, pos.psq_score());
410 Tracing::add(IMBALANCE, ei.mi->material_value());
411 Tracing::add(PAWN, ei.pi->pawns_value());
412 Tracing::add(UNSTOPPABLE, evaluate_unstoppable_pawns(pos, ei));
413 Score w = make_score(ei.mi->space_weight() * evaluate_space<WHITE>(pos, ei), 0);
414 Score b = make_score(ei.mi->space_weight() * evaluate_space<BLACK>(pos, ei), 0);
415 Tracing::add(SPACE, apply_weight(w, Weights[Space]), apply_weight(b, Weights[Space]));
416 Tracing::add(TOTAL, score);
417 Tracing::stream << "\nUncertainty margin: White: " << to_cp(margins[WHITE])
418 << ", Black: " << to_cp(margins[BLACK])
419 << "\nScaling: " << std::noshowpos
420 << std::setw(6) << 100.0 * ei.mi->game_phase() / 128.0 << "% MG, "
421 << std::setw(6) << 100.0 * (1.0 - ei.mi->game_phase() / 128.0) << "% * "
422 << std::setw(6) << (100.0 * sf) / SCALE_FACTOR_NORMAL << "% EG.\n"
423 << "Total evaluation: " << to_cp(v);
426 return pos.side_to_move() == WHITE ? v : -v;
430 // init_eval_info() initializes king bitboards for given color adding
431 // pawn attacks. To be done at the beginning of the evaluation.
434 void init_eval_info(const Position& pos, EvalInfo& ei) {
436 const Color Them = (Us == WHITE ? BLACK : WHITE);
438 Bitboard b = ei.attackedBy[Them][KING] = pos.attacks_from<KING>(pos.king_square(Them));
439 ei.attackedBy[Us][PAWN] = ei.pi->pawn_attacks(Us);
441 // Init king safety tables only if we are going to use them
442 if ( pos.piece_count(Us, QUEEN)
443 && pos.non_pawn_material(Us) > QueenValueMg + PawnValueMg)
445 ei.kingRing[Them] = (b | (Us == WHITE ? b >> 8 : b << 8));
446 b &= ei.attackedBy[Us][PAWN];
447 ei.kingAttackersCount[Us] = b ? popcount<Max15>(b) / 2 : 0;
448 ei.kingAdjacentZoneAttacksCount[Us] = ei.kingAttackersWeight[Us] = 0;
450 ei.kingRing[Them] = ei.kingAttackersCount[Us] = 0;
454 // evaluate_outposts() evaluates bishop and knight outposts squares
456 template<PieceType Piece, Color Us>
457 Score evaluate_outposts(const Position& pos, EvalInfo& ei, Square s) {
459 const Color Them = (Us == WHITE ? BLACK : WHITE);
461 assert (Piece == BISHOP || Piece == KNIGHT);
463 // Initial bonus based on square
464 Value bonus = Outpost[Piece == BISHOP][relative_square(Us, s)];
466 // Increase bonus if supported by pawn, especially if the opponent has
467 // no minor piece which can exchange the outpost piece.
468 if (bonus && (ei.attackedBy[Us][PAWN] & s))
470 if ( !pos.pieces(Them, KNIGHT)
471 && !(same_color_squares(s) & pos.pieces(Them, BISHOP)))
472 bonus += bonus + bonus / 2;
476 return make_score(bonus, bonus);
480 // evaluate_pieces<>() assigns bonuses and penalties to the pieces of a given color
482 template<PieceType Piece, Color Us, bool Trace>
483 Score evaluate_pieces(const Position& pos, EvalInfo& ei, Score& mobility, Bitboard mobilityArea) {
487 Score score = SCORE_ZERO;
489 const Color Them = (Us == WHITE ? BLACK : WHITE);
490 const Square* pl = pos.piece_list(Us, Piece);
492 ei.attackedBy[Us][Piece] = 0;
494 while ((s = *pl++) != SQ_NONE)
496 // Find attacked squares, including x-ray attacks for bishops and rooks
497 b = Piece == BISHOP ? attacks_bb<BISHOP>(s, pos.pieces() ^ pos.pieces(Us, QUEEN))
498 : Piece == ROOK ? attacks_bb< ROOK>(s, pos.pieces() ^ pos.pieces(Us, ROOK, QUEEN))
499 : pos.attacks_from<Piece>(s);
501 ei.attackedBy[Us][Piece] |= b;
503 if (b & ei.kingRing[Them])
505 ei.kingAttackersCount[Us]++;
506 ei.kingAttackersWeight[Us] += KingAttackWeights[Piece];
507 Bitboard bb = (b & ei.attackedBy[Them][KING]);
509 ei.kingAdjacentZoneAttacksCount[Us] += popcount<Max15>(bb);
512 int mob = popcount<Piece == QUEEN ? Full : Max15>(b & mobilityArea);
513 mobility += MobilityBonus[Piece][mob];
515 // Decrease score if we are attacked by an enemy pawn. Remaining part
516 // of threat evaluation must be done later when we have full attack info.
517 if (ei.attackedBy[Them][PAWN] & s)
518 score -= ThreatenedByPawn[Piece];
520 // Otherwise give a bonus if we are a bishop and can pin a piece or can
521 // give a discovered check through an x-ray attack.
522 else if ( Piece == BISHOP
523 && (PseudoAttacks[Piece][pos.king_square(Them)] & s)
524 && !more_than_one(BetweenBB[s][pos.king_square(Them)] & pos.pieces()))
527 // Penalty for bishop with same coloured pawns
529 score -= BishopPawns * ei.pi->pawns_on_same_color_squares(Us, s);
531 // Bishop and knight outposts squares
532 if ( (Piece == BISHOP || Piece == KNIGHT)
533 && !(pos.pieces(Them, PAWN) & attack_span_mask(Us, s)))
534 score += evaluate_outposts<Piece, Us>(pos, ei, s);
536 if ( (Piece == ROOK || Piece == QUEEN)
537 && relative_rank(Us, s) >= RANK_5)
539 // Major piece on 7th rank and enemy king trapped on 8th
540 if ( relative_rank(Us, s) == RANK_7
541 && relative_rank(Us, pos.king_square(Them)) == RANK_8)
542 score += Piece == ROOK ? RookOn7th : QueenOn7th;
544 // Major piece attacking enemy pawns on the same rank
545 Bitboard pawns = pos.pieces(Them, PAWN) & rank_bb(s);
547 score += popcount<Max15>(pawns) * (Piece == ROOK ? RookOnPawn : QueenOnPawn);
550 // Special extra evaluation for rooks
553 // Give a bonus for a rook on a open or semi-open file
554 if (ei.pi->semiopen(Us, file_of(s)))
555 score += ei.pi->semiopen(Them, file_of(s)) ? RookOpenFile : RookSemiopenFile;
557 if (mob > 6 || ei.pi->semiopen(Us, file_of(s)))
560 Square ksq = pos.king_square(Us);
562 // Penalize rooks which are trapped inside a king. Penalize more if
563 // king has lost right to castle.
564 if ( ((file_of(ksq) < FILE_E) == (file_of(s) < file_of(ksq)))
565 && (rank_of(ksq) == rank_of(s) || relative_rank(Us, ksq) == RANK_1)
566 && !ei.pi->semiopen_on_side(Us, file_of(ksq), file_of(ksq) < FILE_E))
567 score -= (TrappedRook - make_score(mob * 8, 0)) * (pos.can_castle(Us) ? 1 : 2);
570 // An important Chess960 pattern: A cornered bishop blocked by a friendly
571 // pawn diagonally in front of it is a very serious problem, especially
572 // when that pawn is also blocked.
575 && (s == relative_square(Us, SQ_A1) || s == relative_square(Us, SQ_H1)))
577 const enum Piece P = make_piece(Us, PAWN);
578 Square d = pawn_push(Us) + (file_of(s) == FILE_A ? DELTA_E : DELTA_W);
579 if (pos.piece_on(s + d) == P)
580 score -= !pos.is_empty(s + d + pawn_push(Us)) ? TrappedBishopA1H1 * 4
581 : pos.piece_on(s + d + d) == P ? TrappedBishopA1H1 * 2
587 Tracing::scores[Us][Piece] = score;
593 // evaluate_threats<>() assigns bonuses according to the type of attacking piece
594 // and the type of attacked one.
596 template<Color Us, bool Trace>
597 Score evaluate_threats(const Position& pos, EvalInfo& ei) {
599 const Color Them = (Us == WHITE ? BLACK : WHITE);
601 Bitboard b, undefendedMinors, weakEnemies;
602 Score score = SCORE_ZERO;
604 // Undefended minors get penalized even if not under attack
605 undefendedMinors = pos.pieces(Them, BISHOP, KNIGHT)
606 & ~ei.attackedBy[Them][ALL_PIECES];
608 if (undefendedMinors)
609 score += UndefendedMinor;
611 // Enemy pieces not defended by a pawn and under our attack
612 weakEnemies = pos.pieces(Them)
613 & ~ei.attackedBy[Them][PAWN]
614 & ei.attackedBy[Us][ALL_PIECES];
616 // Add bonus according to type of attacked enemy piece and to the
617 // type of attacking piece, from knights to queens. Kings are not
618 // considered because are already handled in king evaluation.
620 for (PieceType pt1 = KNIGHT; pt1 < KING; pt1++)
622 b = ei.attackedBy[Us][pt1] & weakEnemies;
624 for (PieceType pt2 = PAWN; pt2 < KING; pt2++)
625 if (b & pos.pieces(pt2))
626 score += Threat[pt1][pt2];
630 Tracing::scores[Us][THREAT] = score;
636 // evaluate_pieces_of_color<>() assigns bonuses and penalties to all the
637 // pieces of a given color.
639 template<Color Us, bool Trace>
640 Score evaluate_pieces_of_color(const Position& pos, EvalInfo& ei, Score& mobility) {
642 const Color Them = (Us == WHITE ? BLACK : WHITE);
644 Score score = mobility = SCORE_ZERO;
646 // Do not include in mobility squares protected by enemy pawns or occupied by our pieces
647 const Bitboard mobilityArea = ~(ei.attackedBy[Them][PAWN] | pos.pieces(Us, PAWN, KING));
649 score += evaluate_pieces<KNIGHT, Us, Trace>(pos, ei, mobility, mobilityArea);
650 score += evaluate_pieces<BISHOP, Us, Trace>(pos, ei, mobility, mobilityArea);
651 score += evaluate_pieces<ROOK, Us, Trace>(pos, ei, mobility, mobilityArea);
652 score += evaluate_pieces<QUEEN, Us, Trace>(pos, ei, mobility, mobilityArea);
654 // Sum up all attacked squares
655 ei.attackedBy[Us][ALL_PIECES] = ei.attackedBy[Us][PAWN] | ei.attackedBy[Us][KNIGHT]
656 | ei.attackedBy[Us][BISHOP] | ei.attackedBy[Us][ROOK]
657 | ei.attackedBy[Us][QUEEN] | ei.attackedBy[Us][KING];
659 Tracing::scores[Us][MOBILITY] = apply_weight(mobility, Weights[Mobility]);
665 // evaluate_king<>() assigns bonuses and penalties to a king of a given color
667 template<Color Us, bool Trace>
668 Score evaluate_king(const Position& pos, EvalInfo& ei, Value margins[]) {
670 const Color Them = (Us == WHITE ? BLACK : WHITE);
672 Bitboard undefended, b, b1, b2, safe;
674 const Square ksq = pos.king_square(Us);
676 // King shelter and enemy pawns storm
677 Score score = ei.pi->king_safety<Us>(pos, ksq);
679 // King safety. This is quite complicated, and is almost certainly far
680 // from optimally tuned.
681 if ( ei.kingAttackersCount[Them] >= 2
682 && ei.kingAdjacentZoneAttacksCount[Them])
684 // Find the attacked squares around the king which has no defenders
685 // apart from the king itself
686 undefended = ei.attackedBy[Them][ALL_PIECES] & ei.attackedBy[Us][KING];
687 undefended &= ~( ei.attackedBy[Us][PAWN] | ei.attackedBy[Us][KNIGHT]
688 | ei.attackedBy[Us][BISHOP] | ei.attackedBy[Us][ROOK]
689 | ei.attackedBy[Us][QUEEN]);
691 // Initialize the 'attackUnits' variable, which is used later on as an
692 // index to the KingDanger[] array. The initial value is based on the
693 // number and types of the enemy's attacking pieces, the number of
694 // attacked and undefended squares around our king, the square of the
695 // king, and the quality of the pawn shelter.
696 attackUnits = std::min(25, (ei.kingAttackersCount[Them] * ei.kingAttackersWeight[Them]) / 2)
697 + 3 * (ei.kingAdjacentZoneAttacksCount[Them] + popcount<Max15>(undefended))
698 + KingExposed[relative_square(Us, ksq)]
699 - mg_value(score) / 32;
701 // Analyse enemy's safe queen contact checks. First find undefended
702 // squares around the king attacked by enemy queen...
703 b = undefended & ei.attackedBy[Them][QUEEN] & ~pos.pieces(Them);
706 // ...then remove squares not supported by another enemy piece
707 b &= ( ei.attackedBy[Them][PAWN] | ei.attackedBy[Them][KNIGHT]
708 | ei.attackedBy[Them][BISHOP] | ei.attackedBy[Them][ROOK]);
710 attackUnits += QueenContactCheck
712 * (Them == pos.side_to_move() ? 2 : 1);
715 // Analyse enemy's safe rook contact checks. First find undefended
716 // squares around the king attacked by enemy rooks...
717 b = undefended & ei.attackedBy[Them][ROOK] & ~pos.pieces(Them);
719 // Consider only squares where the enemy rook gives check
720 b &= PseudoAttacks[ROOK][ksq];
724 // ...then remove squares not supported by another enemy piece
725 b &= ( ei.attackedBy[Them][PAWN] | ei.attackedBy[Them][KNIGHT]
726 | ei.attackedBy[Them][BISHOP] | ei.attackedBy[Them][QUEEN]);
728 attackUnits += RookContactCheck
730 * (Them == pos.side_to_move() ? 2 : 1);
733 // Analyse enemy's safe distance checks for sliders and knights
734 safe = ~(pos.pieces(Them) | ei.attackedBy[Us][ALL_PIECES]);
736 b1 = pos.attacks_from<ROOK>(ksq) & safe;
737 b2 = pos.attacks_from<BISHOP>(ksq) & safe;
739 // Enemy queen safe checks
740 b = (b1 | b2) & ei.attackedBy[Them][QUEEN];
742 attackUnits += QueenCheck * popcount<Max15>(b);
744 // Enemy rooks safe checks
745 b = b1 & ei.attackedBy[Them][ROOK];
747 attackUnits += RookCheck * popcount<Max15>(b);
749 // Enemy bishops safe checks
750 b = b2 & ei.attackedBy[Them][BISHOP];
752 attackUnits += BishopCheck * popcount<Max15>(b);
754 // Enemy knights safe checks
755 b = pos.attacks_from<KNIGHT>(ksq) & ei.attackedBy[Them][KNIGHT] & safe;
757 attackUnits += KnightCheck * popcount<Max15>(b);
759 // To index KingDanger[] attackUnits must be in [0, 99] range
760 attackUnits = std::min(99, std::max(0, attackUnits));
762 // Finally, extract the king danger score from the KingDanger[]
763 // array and subtract the score from evaluation. Set also margins[]
764 // value that will be used for pruning because this value can sometimes
765 // be very big, and so capturing a single attacking piece can therefore
766 // result in a score change far bigger than the value of the captured piece.
767 score -= KingDanger[Us == Search::RootColor][attackUnits];
768 margins[Us] += mg_value(KingDanger[Us == Search::RootColor][attackUnits]);
772 Tracing::scores[Us][KING] = score;
778 // evaluate_passed_pawns<>() evaluates the passed pawns of the given color
780 template<Color Us, bool Trace>
781 Score evaluate_passed_pawns(const Position& pos, EvalInfo& ei) {
783 const Color Them = (Us == WHITE ? BLACK : WHITE);
785 Bitboard b, squaresToQueen, defendedSquares, unsafeSquares, supportingPawns;
786 Score score = SCORE_ZERO;
788 b = ei.pi->passed_pawns(Us);
792 Square s = pop_lsb(&b);
794 assert(pos.pawn_is_passed(Us, s));
796 int r = int(relative_rank(Us, s) - RANK_2);
797 int rr = r * (r - 1);
799 // Base bonus based on rank
800 Value mbonus = Value(17 * rr);
801 Value ebonus = Value(7 * (rr + r + 1));
805 Square blockSq = s + pawn_push(Us);
807 // Adjust bonus based on kings proximity
808 ebonus += Value(square_distance(pos.king_square(Them), blockSq) * 5 * rr);
809 ebonus -= Value(square_distance(pos.king_square(Us), blockSq) * 2 * rr);
811 // If blockSq is not the queening square then consider also a second push
812 if (rank_of(blockSq) != (Us == WHITE ? RANK_8 : RANK_1))
813 ebonus -= Value(square_distance(pos.king_square(Us), blockSq + pawn_push(Us)) * rr);
815 // If the pawn is free to advance, increase bonus
816 if (pos.is_empty(blockSq))
818 squaresToQueen = forward_bb(Us, s);
819 defendedSquares = squaresToQueen & ei.attackedBy[Us][ALL_PIECES];
821 // If there is an enemy rook or queen attacking the pawn from behind,
822 // add all X-ray attacks by the rook or queen. Otherwise consider only
823 // the squares in the pawn's path attacked or occupied by the enemy.
824 if ( (forward_bb(Them, s) & pos.pieces(Them, ROOK, QUEEN))
825 && (forward_bb(Them, s) & pos.pieces(Them, ROOK, QUEEN) & pos.attacks_from<ROOK>(s)))
826 unsafeSquares = squaresToQueen;
828 unsafeSquares = squaresToQueen & (ei.attackedBy[Them][ALL_PIECES] | pos.pieces(Them));
830 // If there aren't enemy attacks huge bonus, a bit smaller if at
831 // least block square is not attacked, otherwise smallest bonus.
832 int k = !unsafeSquares ? 15 : !(unsafeSquares & blockSq) ? 9 : 3;
834 // Big bonus if the path to queen is fully defended, a bit less
835 // if at least block square is defended.
836 if (defendedSquares == squaresToQueen)
839 else if (defendedSquares & blockSq)
840 k += (unsafeSquares & defendedSquares) == unsafeSquares ? 4 : 2;
842 mbonus += Value(k * rr), ebonus += Value(k * rr);
846 // Increase the bonus if the passed pawn is supported by a friendly pawn
847 // on the same rank and a bit smaller if it's on the previous rank.
848 supportingPawns = pos.pieces(Us, PAWN) & adjacent_files_bb(file_of(s));
849 if (supportingPawns & rank_bb(s))
850 ebonus += Value(r * 20);
852 else if (supportingPawns & rank_bb(s - pawn_push(Us)))
853 ebonus += Value(r * 12);
855 // Rook pawns are a special case: They are sometimes worse, and
856 // sometimes better than other passed pawns. It is difficult to find
857 // good rules for determining whether they are good or bad. For now,
858 // we try the following: Increase the value for rook pawns if the
859 // other side has no pieces apart from a knight, and decrease the
860 // value if the other side has a rook or queen.
861 if (file_of(s) == FILE_A || file_of(s) == FILE_H)
863 if (pos.non_pawn_material(Them) <= KnightValueMg)
864 ebonus += ebonus / 4;
865 else if (pos.pieces(Them, ROOK, QUEEN))
866 ebonus -= ebonus / 4;
868 score += make_score(mbonus, ebonus);
873 Tracing::scores[Us][PASSED] = apply_weight(score, Weights[PassedPawns]);
875 // Add the scores to the middle game and endgame eval
876 return apply_weight(score, Weights[PassedPawns]);
880 // evaluate_unstoppable_pawns() evaluates the unstoppable passed pawns for both sides, this is quite
881 // conservative and returns a winning score only when we are very sure that the pawn is winning.
883 Score evaluate_unstoppable_pawns(const Position& pos, EvalInfo& ei) {
885 Bitboard b, b2, blockers, supporters, queeningPath, candidates;
886 Square s, blockSq, queeningSquare;
887 Color c, winnerSide, loserSide;
888 bool pathDefended, opposed;
889 int pliesToGo, movesToGo, oppMovesToGo, sacptg, blockersCount, minKingDist, kingptg, d;
890 int pliesToQueen[] = { 256, 256 };
892 // Step 1. Hunt for unstoppable passed pawns. If we find at least one,
893 // record how many plies are required for promotion.
894 for (c = WHITE; c <= BLACK; c++)
896 // Skip if other side has non-pawn pieces
897 if (pos.non_pawn_material(~c))
900 b = ei.pi->passed_pawns(c);
905 queeningSquare = relative_square(c, file_of(s) | RANK_8);
906 queeningPath = forward_bb(c, s);
908 // Compute plies to queening and check direct advancement
909 movesToGo = rank_distance(s, queeningSquare) - int(relative_rank(c, s) == RANK_2);
910 oppMovesToGo = square_distance(pos.king_square(~c), queeningSquare) - int(c != pos.side_to_move());
911 pathDefended = ((ei.attackedBy[c][ALL_PIECES] & queeningPath) == queeningPath);
913 if (movesToGo >= oppMovesToGo && !pathDefended)
916 // Opponent king cannot block because path is defended and position
917 // is not in check. So only friendly pieces can be blockers.
918 assert(!pos.checkers());
919 assert((queeningPath & pos.pieces()) == (queeningPath & pos.pieces(c)));
921 // Add moves needed to free the path from friendly pieces and retest condition
922 movesToGo += popcount<Max15>(queeningPath & pos.pieces(c));
924 if (movesToGo >= oppMovesToGo && !pathDefended)
927 pliesToGo = 2 * movesToGo - int(c == pos.side_to_move());
928 pliesToQueen[c] = std::min(pliesToQueen[c], pliesToGo);
932 // Step 2. If either side cannot promote at least three plies before the other side then situation
933 // becomes too complex and we give up. Otherwise we determine the possibly "winning side"
934 if (abs(pliesToQueen[WHITE] - pliesToQueen[BLACK]) < 3)
937 winnerSide = (pliesToQueen[WHITE] < pliesToQueen[BLACK] ? WHITE : BLACK);
938 loserSide = ~winnerSide;
940 // Step 3. Can the losing side possibly create a new passed pawn and thus prevent the loss?
941 b = candidates = pos.pieces(loserSide, PAWN);
947 // Compute plies from queening
948 queeningSquare = relative_square(loserSide, file_of(s) | RANK_8);
949 movesToGo = rank_distance(s, queeningSquare) - int(relative_rank(loserSide, s) == RANK_2);
950 pliesToGo = 2 * movesToGo - int(loserSide == pos.side_to_move());
952 // Check if (without even considering any obstacles) we're too far away or doubled
953 if ( pliesToQueen[winnerSide] + 3 <= pliesToGo
954 || (forward_bb(loserSide, s) & pos.pieces(loserSide, PAWN)))
958 // If any candidate is already a passed pawn it _may_ promote in time. We give up.
959 if (candidates & ei.pi->passed_pawns(loserSide))
962 // Step 4. Check new passed pawn creation through king capturing and pawn sacrifices
968 sacptg = blockersCount = 0;
969 minKingDist = kingptg = 256;
971 // Compute plies from queening
972 queeningSquare = relative_square(loserSide, file_of(s) | RANK_8);
973 movesToGo = rank_distance(s, queeningSquare) - int(relative_rank(loserSide, s) == RANK_2);
974 pliesToGo = 2 * movesToGo - int(loserSide == pos.side_to_move());
976 // Generate list of blocking pawns and supporters
977 supporters = adjacent_files_bb(file_of(s)) & candidates;
978 opposed = forward_bb(loserSide, s) & pos.pieces(winnerSide, PAWN);
979 blockers = passed_pawn_mask(loserSide, s) & pos.pieces(winnerSide, PAWN);
983 // How many plies does it take to remove all the blocking pawns?
986 blockSq = pop_lsb(&blockers);
989 // Check pawns that can give support to overcome obstacle, for instance
990 // black pawns: a4, b4 white: b2 then pawn in b4 is giving support.
993 b2 = supporters & in_front_bb(winnerSide, blockSq + pawn_push(winnerSide));
995 while (b2) // This while-loop could be replaced with LSB/MSB (depending on color)
997 d = square_distance(blockSq, pop_lsb(&b2)) - 2;
998 movesToGo = std::min(movesToGo, d);
1002 // Check pawns that can be sacrificed against the blocking pawn
1003 b2 = attack_span_mask(winnerSide, blockSq) & candidates & ~(1ULL << s);
1005 while (b2) // This while-loop could be replaced with LSB/MSB (depending on color)
1007 d = square_distance(blockSq, pop_lsb(&b2)) - 2;
1008 movesToGo = std::min(movesToGo, d);
1011 // If obstacle can be destroyed with an immediate pawn exchange / sacrifice,
1012 // it's not a real obstacle and we have nothing to add to pliesToGo.
1016 // Plies needed to sacrifice against all the blocking pawns
1017 sacptg += movesToGo * 2;
1020 // Plies needed for the king to capture all the blocking pawns
1021 d = square_distance(pos.king_square(loserSide), blockSq);
1022 minKingDist = std::min(minKingDist, d);
1023 kingptg = (minKingDist + blockersCount) * 2;
1026 // Check if pawn sacrifice plan _may_ save the day
1027 if (pliesToQueen[winnerSide] + 3 > pliesToGo + sacptg)
1030 // Check if king capture plan _may_ save the day (contains some false positives)
1031 if (pliesToQueen[winnerSide] + 3 > pliesToGo + kingptg)
1035 // Winning pawn is unstoppable and will promote as first, return big score
1036 Score score = make_score(0, (Value) 1280 - 32 * pliesToQueen[winnerSide]);
1037 return winnerSide == WHITE ? score : -score;
1041 // evaluate_space() computes the space evaluation for a given side. The
1042 // space evaluation is a simple bonus based on the number of safe squares
1043 // available for minor pieces on the central four files on ranks 2--4. Safe
1044 // squares one, two or three squares behind a friendly pawn are counted
1045 // twice. Finally, the space bonus is scaled by a weight taken from the
1046 // material hash table. The aim is to improve play on game opening.
1048 int evaluate_space(const Position& pos, EvalInfo& ei) {
1050 const Color Them = (Us == WHITE ? BLACK : WHITE);
1052 // Find the safe squares for our pieces inside the area defined by
1053 // SpaceMask[]. A square is unsafe if it is attacked by an enemy
1054 // pawn, or if it is undefended and attacked by an enemy piece.
1055 Bitboard safe = SpaceMask[Us]
1056 & ~pos.pieces(Us, PAWN)
1057 & ~ei.attackedBy[Them][PAWN]
1058 & (ei.attackedBy[Us][ALL_PIECES] | ~ei.attackedBy[Them][ALL_PIECES]);
1060 // Find all squares which are at most three squares behind some friendly pawn
1061 Bitboard behind = pos.pieces(Us, PAWN);
1062 behind |= (Us == WHITE ? behind >> 8 : behind << 8);
1063 behind |= (Us == WHITE ? behind >> 16 : behind << 16);
1065 // Since SpaceMask[Us] is fully on our half of the board
1066 assert(unsigned(safe >> (Us == WHITE ? 32 : 0)) == 0);
1068 // Count safe + (behind & safe) with a single popcount
1069 return popcount<Full>((Us == WHITE ? safe << 32 : safe >> 32) | (behind & safe));
1073 // interpolate() interpolates between a middle game and an endgame score,
1074 // based on game phase. It also scales the return value by a ScaleFactor array.
1076 Value interpolate(const Score& v, Phase ph, ScaleFactor sf) {
1078 assert(mg_value(v) > -VALUE_INFINITE && mg_value(v) < VALUE_INFINITE);
1079 assert(eg_value(v) > -VALUE_INFINITE && eg_value(v) < VALUE_INFINITE);
1080 assert(ph >= PHASE_ENDGAME && ph <= PHASE_MIDGAME);
1082 int ev = (eg_value(v) * int(sf)) / SCALE_FACTOR_NORMAL;
1083 int result = (mg_value(v) * int(ph) + ev * int(128 - ph)) / 128;
1084 return Value((result + GrainSize / 2) & ~(GrainSize - 1));
1087 // apply_weight() weights score v by score w trying to prevent overflow
1088 Score apply_weight(Score v, Score w) {
1089 return make_score((int(mg_value(v)) * mg_value(w)) / 0x100,
1090 (int(eg_value(v)) * eg_value(w)) / 0x100);
1093 // weight_option() computes the value of an evaluation weight, by combining
1094 // two UCI-configurable weights (midgame and endgame) with an internal weight.
1096 Score weight_option(const std::string& mgOpt, const std::string& egOpt, Score internalWeight) {
1098 // Scale option value from 100 to 256
1099 int mg = Options[mgOpt] * 256 / 100;
1100 int eg = Options[egOpt] * 256 / 100;
1102 return apply_weight(make_score(mg, eg), internalWeight);
1106 // Tracing functions definitions
1108 double to_cp(Value v) { return double(v) / double(PawnValueMg); }
1110 void Tracing::add(int idx, Score wScore, Score bScore) {
1112 scores[WHITE][idx] = wScore;
1113 scores[BLACK][idx] = bScore;
1116 void Tracing::row(const char* name, int idx) {
1118 Score wScore = scores[WHITE][idx];
1119 Score bScore = scores[BLACK][idx];
1122 case PST: case IMBALANCE: case PAWN: case UNSTOPPABLE: case TOTAL:
1123 stream << std::setw(20) << name << " | --- --- | --- --- | "
1124 << std::setw(6) << to_cp(mg_value(wScore)) << " "
1125 << std::setw(6) << to_cp(eg_value(wScore)) << " \n";
1128 stream << std::setw(20) << name << " | " << std::noshowpos
1129 << std::setw(5) << to_cp(mg_value(wScore)) << " "
1130 << std::setw(5) << to_cp(eg_value(wScore)) << " | "
1131 << std::setw(5) << to_cp(mg_value(bScore)) << " "
1132 << std::setw(5) << to_cp(eg_value(bScore)) << " | "
1134 << std::setw(6) << to_cp(mg_value(wScore - bScore)) << " "
1135 << std::setw(6) << to_cp(eg_value(wScore - bScore)) << " \n";
1139 std::string Tracing::do_trace(const Position& pos) {
1141 Search::RootColor = pos.side_to_move();
1144 stream << std::showpoint << std::showpos << std::fixed << std::setprecision(2);
1145 memset(scores, 0, 2 * (TOTAL + 1) * sizeof(Score));
1148 do_evaluate<true>(pos, margin);
1150 std::string totals = stream.str();
1153 stream << std::setw(21) << "Eval term " << "| White | Black | Total \n"
1154 << " | MG EG | MG EG | MG EG \n"
1155 << "---------------------+-------------+-------------+---------------\n";
1157 row("Material, PST, Tempo", PST);
1158 row("Material imbalance", IMBALANCE);
1160 row("Knights", KNIGHT);
1161 row("Bishops", BISHOP);
1163 row("Queens", QUEEN);
1164 row("Mobility", MOBILITY);
1165 row("King safety", KING);
1166 row("Threats", THREAT);
1167 row("Passed pawns", PASSED);
1168 row("Unstoppable pawns", UNSTOPPABLE);
1169 row("Space", SPACE);
1171 stream << "---------------------+-------------+-------------+---------------\n";
1172 row("Total", TOTAL);
1175 return stream.str();