X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fevaluate.cpp;h=c880b7c7845f3c881ba2d7600a662c393e6a9436;hb=9369f4963d9376820cb5ca4bad66b86e67b0a010;hp=6fe4af628b051883dff3fec72ed4d987300291e7;hpb=da579e46b71ef67871ec940209b63b44fe352fbf;p=stockfish diff --git a/src/evaluate.cpp b/src/evaluate.cpp index 6fe4af62..c880b7c7 100644 --- a/src/evaluate.cpp +++ b/src/evaluate.cpp @@ -1,7 +1,7 @@ /* Stockfish, a UCI chess playing engine derived from Glaurung 2.1 Copyright (C) 2004-2008 Tord Romstad (Glaurung author) - Copyright (C) 2008-2009 Marco Costalba + Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, 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 @@ -17,1220 +17,915 @@ along with this program. If not, see . */ - -//// -//// Includes -//// - +#include #include -#include +#include // For std::memset +#include +#include +#include "bitcount.h" #include "evaluate.h" #include "material.h" #include "pawns.h" -#include "scale.h" -#include "thread.h" -#include "ucioption.h" - - -//// -//// Local definitions -//// namespace { - const int Sign[2] = {1, -1}; - - // Evaluation grain size, must be a power of 2. - const int GrainSize = 4; - - // Evaluation weights, initialized from UCI options - int WeightMobilityMidgame, WeightMobilityEndgame; - int WeightPawnStructureMidgame, WeightPawnStructureEndgame; - int WeightPassedPawnsMidgame, WeightPassedPawnsEndgame; - int WeightKingSafety[2]; - int WeightSpace; - - // Internal evaluation weights. These are applied on top of the evaluation - // weights read from UCI parameters. The purpose is to be able to change - // the evaluation weights while keeping the default values of the UCI - // parameters at 100, which looks prettier. - // - // Values modified by Joona Kiiski - const int WeightMobilityMidgameInternal = 0x0FA; - const int WeightMobilityEndgameInternal = 0x10A; - const int WeightPawnStructureMidgameInternal = 0x0EC; - const int WeightPawnStructureEndgameInternal = 0x0CD; - const int WeightPassedPawnsMidgameInternal = 0x108; - const int WeightPassedPawnsEndgameInternal = 0x109; - const int WeightKingSafetyInternal = 0x0F7; - const int WeightKingOppSafetyInternal = 0x101; - const int WeightSpaceInternal = 0x02F; - - // Visually better to define tables constants - typedef Value V; - - // Knight mobility bonus in middle game and endgame, indexed by the number - // of attacked squares not occupied by friendly piecess. - const Value MidgameKnightMobilityBonus[] = { - // 0 1 2 3 4 5 6 7 8 - V(-30), V(-20),V(-10), V(0), V(10), V(20), V(25), V(30), V(30) + // Struct EvalInfo contains various information computed and collected + // by the evaluation functions. + struct EvalInfo { + + // Pointers to material and pawn hash table entries + Material::Entry* mi; + Pawns::Entry* pi; + + // 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]; + + // 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]; + + // 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]; + + // 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]; + + // kingAdjacentZoneAttacksCount[color] is the number of attacks by the given + // color to squares directly adjacent to the enemy king. Pieces which attack + // more than one square are counted multiple times. For instance, if there is + // a white knight on g5 and black's king is on g8, this white knight adds 2 + // to kingAdjacentZoneAttacksCount[WHITE]. + int kingAdjacentZoneAttacksCount[COLOR_NB]; + + Bitboard pinnedPieces[COLOR_NB]; }; - const Value EndgameKnightMobilityBonus[] = { - // 0 1 2 3 4 5 6 7 8 - V(-30), V(-20),V(-10), V(0), V(10), V(20), V(25), V(30), V(30) - }; + namespace Tracing { - // Bishop mobility bonus in middle game and endgame, indexed by the number - // of attacked squares not occupied by friendly pieces. X-ray attacks through - // queens are also included. - const Value MidgameBishopMobilityBonus[] = { - // 0 1 2 3 4 5 6 7 - V(-30), V(-15), V(0), V(15), V(30), V(45), V(58), V(66), - // 8 9 10 11 12 13 14 15 - V( 72), V( 76), V(78), V(80), V(81), V(82), V(83), V(83) - }; + enum Terms { // First 8 entries are for PieceType + MATERIAL = 8, IMBALANCE, MOBILITY, THREAT, PASSED, SPACE, TOTAL, TERMS_NB + }; - const Value EndgameBishopMobilityBonus[] = { - // 0 1 2 3 4 5 6 7 - V(-30), V(-15), V(0), V(15), V(30), V(45), V(58), V(66), - // 8 9 10 11 12 13 14 15 - V( 72), V( 76), V(78), V(80), V(81), V(82), V(83), V(83) - }; + Score scores[COLOR_NB][TERMS_NB]; + EvalInfo ei; + ScaleFactor sf; - // Rook mobility bonus in middle game and endgame, indexed by the number - // of attacked squares not occupied by friendly pieces. X-ray attacks through - // queens and rooks are also included. - const Value MidgameRookMobilityBonus[] = { - // 0 1 2 3 4 5 6 7 - V(-18), V(-12), V(-6), V(0), V(6), V(12), V(16), V(21), - // 8 9 10 11 12 13 14 15 - V( 24), V( 27), V(28), V(29), V(30), V(31), V(32), V(33) - }; + 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); + } - const Value EndgameRookMobilityBonus[] = { - // 0 1 2 3 4 5 6 7 - V(-30), V(-18), V(-6), V(6), V(18), V(30), V(42), V(54), - // 8 9 10 11 12 13 14 15 - V( 66), V( 74), V(78), V(80), V(81), V(82), V(83), V(83) + // 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} }; - // Queen mobility bonus in middle game and endgame, indexed by the number - // of attacked squares not occupied by friendly pieces. - const Value MidgameQueenMobilityBonus[] = { - // 0 1 2 3 4 5 6 7 - V(-10), V(-8), V(-6), V(-4), V(-2), V( 0), V( 2), V( 4), - // 8 9 10 11 12 13 14 15 - V( 6), V( 8), V(10), V(12), V(13), V(14), V(15), V(16), - // 16 17 18 19 20 21 22 23 - V( 16), V(16), V(16), V(16), V(16), V(16), V(16), V(16), - // 24 25 26 27 28 29 30 31 - V( 16), V(16), V(16), V(16), V(16), V(16), V(16), V(16) + #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) } }; - const Value EndgameQueenMobilityBonus[] = { - // 0 1 2 3 4 5 6 7 - V(-20),V(-15),V(-10), V(-5), V( 0), V( 5), V(10), V(15), - // 8 9 10 11 12 13 14 15 - V( 19), V(23), V(27), V(29), V(30), V(30), V(30), V(30), - // 16 17 18 19 20 21 22 23 - V( 30), V(30), V(30), V(30), V(30), V(30), V(30), V(30), - // 24 25 26 27 28 29 30 31 - V( 30), V(30), V(30), V(30), V(30), V(30), V(30), V(30) + // 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 bonuses for knights and bishops, indexed by square (from white's - // point of view). - const Value KnightOutpostBonus[64] = { - // A B C D E F G H - V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 1 - V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 2 - V(0), V(0), V(5),V(10),V(10), V(5), V(0), V(0), // 3 - V(0), V(5),V(20),V(30),V(30),V(20), V(5), V(0), // 4 - V(0),V(10),V(30),V(40),V(40),V(30),V(10), V(0), // 5 - V(0), V(5),V(20),V(20),V(20),V(20), V(5), V(0), // 6 - V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 7 - V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0) // 8 + // 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 }; - const Value BishopOutpostBonus[64] = { - // A B C D E F G H - V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 1 - V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 2 - V(0), V(0), V(5), V(5), V(5), V(5), V(0), V(0), // 3 - V(0), V(5),V(10),V(10),V(10),V(10), V(5), V(0), // 4 - V(0),V(10),V(20),V(20),V(20),V(20),V(10), V(0), // 5 - V(0), V(5), V(8), V(8), V(8), V(8), V(5), V(0), // 6 - V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0), // 7 - V(0), V(0), V(0), V(0), V(0), V(0), V(0), V(0) // 8 + // 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(107, 138), S(84, 122), S(114, 203), S(121, 217) }; - // Bonus for unstoppable passed pawns - const Value UnstoppablePawnValue = Value(0x500); - - // Rooks and queens on the 7th rank - const Value MidgameRookOn7thBonus = Value(47); - const Value EndgameRookOn7thBonus = Value(98); - const Value MidgameQueenOn7thBonus = Value(27); - const Value EndgameQueenOn7thBonus = Value(54); - - - // Rooks on open files - const Value RookOpenFileBonus = Value(43); - const Value RookHalfOpenFileBonus = Value(19); - - // Penalty for rooks trapped inside a friendly king which has lost the - // right to castle: - const Value TrappedRookPenalty = Value(180); - - // Penalty for a bishop on a7/h7 (a2/h2 for black) which is trapped by - // enemy pawns: - const Value TrappedBishopA7H7Penalty = Value(300); - - // Bitboard masks for detecting trapped bishops on a7/h7 (a2/h2 for black): - const Bitboard MaskA7H7[2] = { - ((1ULL << SQ_A7) | (1ULL << SQ_H7)), - ((1ULL << SQ_A2) | (1ULL << SQ_H2)) - }; + // 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 + // a friendly pawn on b2/g2 (b7/g7 for black). This can obviously only // happen in Chess960 games. - const Value TrappedBishopA1H1Penalty = Value(100); + const Score TrappedBishopA1H1 = S(50, 50); - // Bitboard masks for detecting trapped bishops on a1/h1 (a8/h8 for black): - const Bitboard MaskA1H1[2] = { - ((1ULL << SQ_A1) | (1ULL << SQ_H1)), - ((1ULL << SQ_A8) | (1ULL << SQ_H8)) - }; + #undef S + #undef V - // The SpaceMask[color] contains area of the board which is consdered by - // the space evaluation. In the middle game, each side is given a bonus + // 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[2] = { - (1ULL< + void init_eval_info(const Position& pos, EvalInfo& ei) { - // Array which gives the number of nonzero bits in an 8-bit integer: - uint8_t BitCount8Bit[256]; + const Color Them = (Us == WHITE ? BLACK : WHITE); + const Square Down = (Us == WHITE ? DELTA_S : DELTA_N); - // Function prototypes - template - void evaluate_pieces(const Position& p, Color us, EvalInfo& ei); + ei.pinnedPieces[Us] = pos.pinned_pieces(Us); - template<> - void evaluate_pieces(const Position& p, Color us, EvalInfo &ei); + Bitboard b = ei.attackedBy[Them][KING] = pos.attacks_from(pos.king_square(Them)); + ei.attackedBy[Us][ALL_PIECES] = ei.attackedBy[Us][PAWN] = ei.pi->pawn_attacks(Us); - void evaluate_passed_pawns(const Position &pos, EvalInfo &ei); - void evaluate_trapped_bishop_a7h7(const Position &pos, Square s, Color us, - EvalInfo &ei); - void evaluate_trapped_bishop_a1h1(const Position &pos, Square s, Color us, - EvalInfo &ei); + // 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(b); + b &= ei.attackedBy[Us][PAWN]; + ei.kingAttackersCount[Us] = b ? popcount(b) : 0; + ei.kingAdjacentZoneAttacksCount[Us] = ei.kingAttackersWeight[Us] = 0; + } + else + ei.kingRing[Them] = ei.kingAttackersCount[Us] = 0; + } - void evaluate_space(const Position &p, Color us, EvalInfo &ei); - inline Value apply_weight(Value v, int w); - Value scale_by_game_phase(Value mv, Value ev, Phase ph, const ScaleFactor sf[]); - int count_1s_8bit(Bitboard b); + // evaluate_outpost() evaluates bishop and knight outpost squares - int compute_weight(int uciWeight, int internalWeight); - int weight_option(const std::string& opt, int weight); - void init_safety(); + template + Score evaluate_outpost(const Position& pos, const EvalInfo& ei, Square s) { -} + const Color Them = (Us == WHITE ? BLACK : WHITE); + assert (Pt == BISHOP || Pt == KNIGHT); -//// -//// Functions -//// + // Initial bonus based on square + Value bonus = Outpost[Pt == BISHOP][relative_square(Us, s)]; -/// evaluate() is the main evaluation function. It always computes two -/// values, an endgame score and a middle game score, and interpolates -/// between them based on the remaining material. + // 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)) + { + if ( !pos.pieces(Them, KNIGHT) + && !(squares_of_color(s) & pos.pieces(Them, BISHOP))) + bonus += bonus + bonus / 2; + else + bonus += bonus / 2; + } -Value evaluate(const Position &pos, EvalInfo &ei, int threadID) { + return make_score(bonus * 2, bonus / 2); + } - assert(pos.is_ok()); - assert(threadID >= 0 && threadID < THREAD_MAX); - memset(&ei, 0, sizeof(EvalInfo)); + // evaluate_pieces() assigns bonuses and penalties to the pieces of a given color - // Initialize by reading the incrementally updated scores included in the - // position object (material + piece square tables) - ei.mgValue = pos.mg_value(); - ei.egValue = pos.eg_value(); + template + Score evaluate_pieces(const Position& pos, EvalInfo& ei, Score* mobility, Bitboard* mobilityArea) { - // Probe the material hash table - ei.mi = MaterialTable[threadID]->get_material_info(pos); - ei.mgValue += ei.mi->mg_value(); - ei.egValue += ei.mi->eg_value(); + Bitboard b; + Square s; + Score score = SCORE_ZERO; - // 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); + const PieceType NextPt = (Us == WHITE ? Pt : PieceType(Pt + 1)); + const Color Them = (Us == WHITE ? BLACK : WHITE); + const Square* pl = pos.list(Us); - // After get_material_info() call that modifies them - ScaleFactor factor[2]; - factor[WHITE] = ei.mi->scale_factor(pos, WHITE); - factor[BLACK] = ei.mi->scale_factor(pos, BLACK); + ei.attackedBy[Us][Pt] = 0; - // Probe the pawn hash table - ei.pi = PawnTable[threadID]->get_pawn_info(pos); - ei.mgValue += apply_weight(ei.pi->mg_value(), WeightPawnStructureMidgame); - ei.egValue += apply_weight(ei.pi->eg_value(), WeightPawnStructureEndgame); + while ((s = *pl++) != SQ_NONE) + { + // Find attacked squares, including x-ray attacks for bishops and rooks + b = Pt == BISHOP ? attacks_bb(s, pos.pieces() ^ pos.pieces(Us, QUEEN)) + : Pt == ROOK ? attacks_bb< ROOK>(s, pos.pieces() ^ pos.pieces(Us, ROOK, QUEEN)) + : pos.attacks_from(s); - // Initialize king attack bitboards and king attack zones for both sides - ei.attackedBy[WHITE][KING] = pos.piece_attacks(pos.king_square(WHITE)); - ei.attackedBy[BLACK][KING] = pos.piece_attacks(pos.king_square(BLACK)); - ei.kingZone[WHITE] = ei.attackedBy[BLACK][KING] | (ei.attackedBy[BLACK][KING] >> 8); - ei.kingZone[BLACK] = ei.attackedBy[WHITE][KING] | (ei.attackedBy[WHITE][KING] << 8); + if (ei.pinnedPieces[Us] & s) + b &= LineBB[pos.king_square(Us)][s]; - // Initialize pawn attack bitboards for both sides - ei.attackedBy[WHITE][PAWN] = ((pos.pawns(WHITE) << 9) & ~FileABB) | ((pos.pawns(WHITE) << 7) & ~FileHBB); - ei.attackedBy[BLACK][PAWN] = ((pos.pawns(BLACK) >> 7) & ~FileABB) | ((pos.pawns(BLACK) >> 9) & ~FileHBB); - ei.kingAttackersCount[WHITE] = count_1s_max_15(ei.attackedBy[WHITE][PAWN] & ei.attackedBy[BLACK][KING])/2; - ei.kingAttackersCount[BLACK] = count_1s_max_15(ei.attackedBy[BLACK][PAWN] & ei.attackedBy[WHITE][KING])/2; + ei.attackedBy[Us][ALL_PIECES] |= ei.attackedBy[Us][Pt] |= b; - // Evaluate pieces - for (Color c = WHITE; c <= BLACK; c++) - { - evaluate_pieces(pos, c, ei); - evaluate_pieces(pos, c, ei); - evaluate_pieces(pos, c, ei); - evaluate_pieces(pos, c, ei); - - // Sum up all attacked squares - ei.attackedBy[c][0] = ei.attackedBy[c][PAWN] | ei.attackedBy[c][KNIGHT] - | ei.attackedBy[c][BISHOP] | ei.attackedBy[c][ROOK] - | ei.attackedBy[c][QUEEN] | ei.attackedBy[c][KING]; - } + if (b & ei.kingRing[Them]) + { + ei.kingAttackersCount[Us]++; + ei.kingAttackersWeight[Us] += KingAttackWeights[Pt]; + Bitboard bb = b & ei.attackedBy[Them][KING]; + if (bb) + ei.kingAdjacentZoneAttacksCount[Us] += popcount(bb); + } - // Kings. Kings are evaluated after all other pieces for both sides, - // because we need complete attack information for all pieces when computing - // the king safety evaluation. - for (Color c = WHITE; c <= BLACK; c++) - evaluate_pieces(pos, c, ei); + if (Pt == QUEEN) + b &= ~( ei.attackedBy[Them][KNIGHT] + | ei.attackedBy[Them][BISHOP] + | ei.attackedBy[Them][ROOK]); - // Evaluate passed pawns. We evaluate passed pawns for both sides at once, - // because we need to know which side promotes first in positions where - // both sides have an unstoppable passed pawn. - if (ei.pi->passed_pawns()) - evaluate_passed_pawns(pos, ei); + int mob = Pt != QUEEN ? popcount(b & mobilityArea[Us]) + : popcount(b & mobilityArea[Us]); - Phase phase = pos.game_phase(); + mobility[Us] += MobilityBonus[Pt][mob]; - // Middle-game specific evaluation terms - if (phase > PHASE_ENDGAME) - { - // Pawn storms in positions with opposite castling. - if ( square_file(pos.king_square(WHITE)) >= FILE_E - && square_file(pos.king_square(BLACK)) <= FILE_D) + // 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]; - ei.mgValue += ei.pi->queenside_storm_value(WHITE) - - ei.pi->kingside_storm_value(BLACK); + if (Pt == BISHOP || Pt == KNIGHT) + { + // Bonus for outpost square + if (!(pos.pieces(Them, PAWN) & pawn_attack_span(Us, s))) + score += evaluate_outpost(pos, ei, s); + + // 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); + + // An important Chess960 pattern: A cornered bishop blocked by a friendly + // pawn diagonally in front of it is a very serious problem, especially + // when that pawn is also blocked. + if ( Pt == BISHOP + && pos.is_chess960() + && (s == relative_square(Us, SQ_A1) || s == relative_square(Us, SQ_H1))) + { + Square d = pawn_push(Us) + (file_of(s) == FILE_A ? DELTA_E : DELTA_W); + if (pos.piece_on(s + d) == make_piece(Us, PAWN)) + score -= !pos.empty(s + d + pawn_push(Us)) ? TrappedBishopA1H1 * 4 + : pos.piece_on(s + d + d) == make_piece(Us, PAWN) ? TrappedBishopA1H1 * 2 + : TrappedBishopA1H1; + } + } - else if ( square_file(pos.king_square(WHITE)) <= FILE_D - && square_file(pos.king_square(BLACK)) >= FILE_E) + if (Pt == ROOK) + { + // Bonus for aligning 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(alignedPawns) * RookOnPawn; + } - ei.mgValue += ei.pi->kingside_storm_value(WHITE) - - ei.pi->queenside_storm_value(BLACK); + // 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; - // Evaluate space for both sides - if (ei.mi->space_weight() > 0) - { - evaluate_space(pos, WHITE, ei); - evaluate_space(pos, BLACK, ei); + // Penalize when trapped by the king, even more if king cannot castle + if (mob <= 3 && !ei.pi->semiopen_file(Us, file_of(s))) + { + 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))) + score -= (TrappedRook - make_score(mob * 22, 0)) * (1 + !pos.can_castle(Us)); + } + } } - } - // Mobility - ei.mgValue += apply_weight(ei.mgMobility, WeightMobilityMidgame); - ei.egValue += apply_weight(ei.egMobility, WeightMobilityEndgame); + if (Trace) + Tracing::write(Pt, Us, score); - // If we don't already have an unusual scale factor, check for opposite - // colored bishop endgames, and use a lower scale for those - if ( phase < PHASE_MIDGAME - && pos.opposite_colored_bishops() - && ( (factor[WHITE] == SCALE_FACTOR_NORMAL && ei.egValue > Value(0)) - || (factor[BLACK] == SCALE_FACTOR_NORMAL && ei.egValue < Value(0)))) - { - ScaleFactor sf; - - // Only the two bishops ? - if ( pos.non_pawn_material(WHITE) == BishopValueMidgame - && pos.non_pawn_material(BLACK) == BishopValueMidgame) - { - // Check for KBP vs KB with only a single pawn that is almost - // certainly a draw or at least two pawns. - bool one_pawn = (pos.piece_count(WHITE, PAWN) + pos.piece_count(BLACK, PAWN) == 1); - sf = one_pawn ? ScaleFactor(8) : ScaleFactor(32); - } - else - // Endgame with opposite-colored bishops, but also other pieces. Still - // a bit drawish, but not as drawish as with only the two bishops. - sf = ScaleFactor(50); - - if (factor[WHITE] == SCALE_FACTOR_NORMAL) - factor[WHITE] = sf; - if (factor[BLACK] == SCALE_FACTOR_NORMAL) - factor[BLACK] = sf; + // Recursively call evaluate_pieces() of next piece type until KING excluded + return score - evaluate_pieces(pos, ei, mobility, mobilityArea); } - // Interpolate between the middle game and the endgame score, and - // return - Color stm = pos.side_to_move(); + template<> + Score evaluate_pieces(const Position&, EvalInfo&, Score*, Bitboard*) { return SCORE_ZERO; } + template<> + Score evaluate_pieces(const Position&, EvalInfo&, Score*, Bitboard*) { return SCORE_ZERO; } - Value v = Sign[stm] * scale_by_game_phase(ei.mgValue, ei.egValue, phase, factor); - return (ei.mateThreat[stm] == MOVE_NONE ? v : 8 * QueenValueMidgame - v); -} + // evaluate_king() assigns bonuses and penalties to a king of a given color + template + Score evaluate_king(const Position& pos, const EvalInfo& ei) { -/// quick_evaluate() does a very approximate evaluation of the current position. -/// It currently considers only material and piece square table scores. Perhaps -/// we should add scores from the pawn and material hash tables? + const Color Them = (Us == WHITE ? BLACK : WHITE); -Value quick_evaluate(const Position &pos) { + Bitboard undefended, b, b1, b2, safe; + int attackUnits; + const Square ksq = pos.king_square(Us); - assert(pos.is_ok()); + // King shelter and enemy pawns storm + Score score = ei.pi->king_safety(pos, ksq); - static const - ScaleFactor sf[2] = {SCALE_FACTOR_NORMAL, SCALE_FACTOR_NORMAL}; + // Main king safety evaluation + if (ei.kingAttackersCount[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(undefended) + + 11 * (ei.pinnedPieces[Us] != 0) + - mg_value(score) / 8 + - !pos.count(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]; - Value mgv = pos.mg_value(); - Value egv = pos.eg_value(); - Phase ph = pos.game_phase(); - Color stm = pos.side_to_move(); + if (b) + attackUnits += QueenContactCheck * popcount(b); + } - return Sign[stm] * scale_by_game_phase(mgv, egv, ph, sf); -} + // 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); + // Consider only squares where the enemy's rook gives check + b &= PseudoAttacks[ROOK][ksq]; -/// init_eval() initializes various tables used by the evaluation function. + 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]); -void init_eval(int threads) { + if (b) + attackUnits += RookContactCheck * popcount(b); + } - assert(threads <= THREAD_MAX); + // Analyse the enemy's safe distance checks for sliders and knights + safe = ~(ei.attackedBy[Us][ALL_PIECES] | pos.pieces(Them)); - for (int i = 0; i < THREAD_MAX; i++) - { - if (i >= threads) - { - delete PawnTable[i]; - delete MaterialTable[i]; - PawnTable[i] = NULL; - MaterialTable[i] = NULL; - continue; - } - if (!PawnTable[i]) - PawnTable[i] = new PawnInfoTable(PawnTableSize); - if (!MaterialTable[i]) - MaterialTable[i] = new MaterialInfoTable(MaterialTableSize); - } + b1 = pos.attacks_from(ksq) & safe; + b2 = pos.attacks_from(ksq) & safe; - for (Bitboard b = 0ULL; b < 256ULL; b++) - { - assert(count_1s(b) == int(uint8_t(count_1s(b)))); - BitCount8Bit[b] = (uint8_t)count_1s(b); - } -} + // Enemy queen safe checks + b = (b1 | b2) & ei.attackedBy[Them][QUEEN]; + if (b) + attackUnits += QueenCheck * popcount(b); + // Enemy rooks safe checks + b = b1 & ei.attackedBy[Them][ROOK]; + if (b) + attackUnits += RookCheck * popcount(b); -/// quit_eval() releases heap-allocated memory at program termination. + // Enemy bishops safe checks + b = b2 & ei.attackedBy[Them][BISHOP]; + if (b) + attackUnits += BishopCheck * popcount(b); -void quit_eval() { + // Enemy knights safe checks + b = pos.attacks_from(ksq) & ei.attackedBy[Them][KNIGHT] & safe; + if (b) + attackUnits += KnightCheck * popcount(b); - for (int i = 0; i < THREAD_MAX; i++) - { - delete PawnTable[i]; - delete MaterialTable[i]; - PawnTable[i] = NULL; - MaterialTable[i] = NULL; - } -} + // 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)]; + } + if (Trace) + Tracing::write(KING, Us, score); -/// read_weights() reads evaluation weights from the corresponding UCI -/// parameters. + return score; + } -void read_weights(Color us) { - WeightMobilityMidgame = weight_option("Mobility (Middle Game)", WeightMobilityMidgameInternal); - WeightMobilityEndgame = weight_option("Mobility (Endgame)", WeightMobilityEndgameInternal); - WeightPawnStructureMidgame = weight_option("Pawn Structure (Middle Game)", WeightPawnStructureMidgameInternal); - WeightPawnStructureEndgame = weight_option("Pawn Structure (Endgame)", WeightPawnStructureEndgameInternal); - WeightPassedPawnsMidgame = weight_option("Passed Pawns (Middle Game)", WeightPassedPawnsMidgameInternal); - WeightPassedPawnsEndgame = weight_option("Passed Pawns (Endgame)", WeightPassedPawnsEndgameInternal); + // evaluate_threats() assigns bonuses according to the type of attacking piece + // and the type of attacked one. - Color them = opposite_color(us); + template + Score evaluate_threats(const Position& pos, const EvalInfo& ei) { - WeightKingSafety[us] = weight_option("Cowardice", WeightKingSafetyInternal); - WeightKingSafety[them] = weight_option("Aggressiveness", WeightKingOppSafetyInternal); - WeightSpace = weight_option("Space", WeightSpaceInternal); + 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); - init_safety(); -} + enum { Defended, Weak }; + enum { Minor, Major }; + Bitboard b, weak, defended; + Score score = SCORE_ZERO; -namespace { + // Non-pawn enemies defended by a pawn + defended = (pos.pieces(Them) ^ pos.pieces(Them, PAWN)) + & ei.attackedBy[Them][PAWN]; - // evaluate_common() computes terms common to all pieces attack + // 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)))]; - template - int evaluate_common(const Position& p, const Bitboard& b, Color us, EvalInfo& ei, Square s = SQ_NONE) { + b = defended & (ei.attackedBy[Us][ROOK]); + while (b) + score += Threat[Defended][Major][type_of(pos.piece_on(pop_lsb(&b)))]; + } - static const int AttackWeight[] = { 0, 0, KnightAttackWeight, BishopAttackWeight, RookAttackWeight, QueenAttackWeight }; - static const Value* MgBonus[] = { 0, 0, MidgameKnightMobilityBonus, MidgameBishopMobilityBonus, MidgameRookMobilityBonus, MidgameQueenMobilityBonus }; - static const Value* EgBonus[] = { 0, 0, EndgameKnightMobilityBonus, EndgameBishopMobilityBonus, EndgameRookMobilityBonus, EndgameQueenMobilityBonus }; - static const Value* OutpostBonus[] = { 0, 0, KnightOutpostBonus, BishopOutpostBonus, 0, 0 }; + // Enemies not defended by a pawn and under our attack + weak = pos.pieces(Them) + & ~ei.attackedBy[Them][PAWN] + & ei.attackedBy[Us][ALL_PIECES]; - Color them = opposite_color(us); + // Add a bonus according to the kind of attacking pieces + if (weak) + { + b = weak & (ei.attackedBy[Us][KNIGHT] | ei.attackedBy[Us][BISHOP]); + while (b) + score += Threat[Weak][Minor][type_of(pos.piece_on(pop_lsb(&b)))]; - // Update attack info - ei.attackedBy[us][Piece] |= b; + b = weak & (ei.attackedBy[Us][ROOK] | ei.attackedBy[Us][QUEEN]); + while (b) + score += Threat[Weak][Major][type_of(pos.piece_on(pop_lsb(&b)))]; - // King attack - if (b & ei.kingZone[us]) - { - ei.kingAttackersCount[us]++; - ei.kingAttackersWeight[us] += AttackWeight[Piece]; - Bitboard bb = (b & ei.attackedBy[them][KING]); - if (bb) - ei.kingAdjacentZoneAttacksCount[us] += count_1s_max_15(bb); + b = weak & ~ei.attackedBy[Them][ALL_PIECES]; + if (b) + score += Hanging * popcount(b); + + b = weak & ei.attackedBy[Us][KING]; + if (b) + score += more_than_one(b) ? KingOnMany : KingOnOne; } - // Remove squares protected by enemy pawns - Bitboard bb = (b & ~ei.attackedBy[them][PAWN]); + // Add a small bonus for safe pawn pushes + b = pos.pieces(Us, PAWN) & ~TRank7BB; + b = shift_bb(b | (shift_bb(b & TRank2BB) & ~pos.pieces())); - // Mobility - int mob = (Piece != QUEEN ? count_1s_max_15(bb & ~p.pieces_of_color(us)) - : count_1s(bb & ~p.pieces_of_color(us))); + b &= ~pos.pieces() + & ~ei.attackedBy[Them][PAWN] + & (ei.attackedBy[Us][ALL_PIECES] | ~ei.attackedBy[Them][ALL_PIECES]); - ei.mgMobility += Sign[us] * MgBonus[Piece][mob]; - ei.egMobility += Sign[us] * EgBonus[Piece][mob]; + if (b) + score += popcount(b) * PawnSafePush; - // Bishop and Knight outposts - if ( (Piece == BISHOP || Piece == KNIGHT) // compile time condition - && p.square_is_weak(s, them)) - { - // Initial bonus based on square - Value v, bonus; - v = bonus = OutpostBonus[Piece][relative_square(us, s)]; + // Add another bonus if the pawn push attacks an enemy piece + b = (shift_bb(b) | shift_bb(b)) + & pos.pieces(Them) + & ~ei.attackedBy[Us][PAWN]; - // Increase bonus if supported by pawn, especially if the opponent has - // no minor piece which can exchange the outpost piece - if (v && (p.pawn_attacks(them, s) & p.pawns(us))) - { - bonus += v / 2; - if ( p.piece_count(them, KNIGHT) == 0 - && (SquaresByColorBB[square_color(s)] & p.bishops(them)) == EmptyBoardBB) - bonus += v; - } - ei.mgValue += Sign[us] * bonus; - ei.egValue += Sign[us] * bonus; - } - return mob; + if (b) + score += popcount(b) * PawnAttackThreat; + + if (Trace) + Tracing::write(Tracing::THREAT, Us, score); + + return score; } - // evaluate_pieces<>() assigns bonuses and penalties to the pieces of a given - // color. + // evaluate_passed_pawns() evaluates the passed pawns of the given color - template - void evaluate_pieces(const Position& pos, Color us, EvalInfo& ei) { + template + Score evaluate_passed_pawns(const Position& pos, const EvalInfo& ei) { - Bitboard b; - Square s, ksq; - Color them; - int mob; - File f; + const Color Them = (Us == WHITE ? BLACK : WHITE); - for (int i = 0, e = pos.piece_count(us, Piece); i < e; i++) - { - s = pos.piece_list(us, Piece, i); + Bitboard b, squaresToQueen, defendedSquares, unsafeSquares; + Score score = SCORE_ZERO; - if (Piece == KNIGHT || Piece == QUEEN) - b = pos.piece_attacks(s); - else if (Piece == BISHOP) - b = bishop_attacks_bb(s, pos.occupied_squares() & ~pos.queens(us)); - else if (Piece == ROOK) - b = rook_attacks_bb(s, pos.occupied_squares() & ~pos.rooks_and_queens(us)); + b = ei.pi->passed_pawns(Us); - // Attacks, mobility and outposts - mob = evaluate_common(pos, b, us, ei, s); + while (b) + { + Square s = pop_lsb(&b); - // Special patterns: trapped bishops on a7/h7/a2/h2 - // and trapped bishops on a1/h1/a8/h8 in Chess960. - if (Piece == BISHOP) - { - if (bit_is_set(MaskA7H7[us], s)) - evaluate_trapped_bishop_a7h7(pos, s, us, ei); + assert(pos.pawn_passed(Us, s)); - if (Chess960 && bit_is_set(MaskA1H1[us], s)) - evaluate_trapped_bishop_a1h1(pos, s, us, ei); - } + int r = relative_rank(Us, s) - RANK_2; + int rr = r * (r - 1); - if (Piece == ROOK || Piece == QUEEN) + // Base bonus based on rank + Value mbonus = Value(17 * rr), ebonus = Value(7 * (rr + r + 1)); + + if (rr) { - // Queen or rook on 7th rank - them = opposite_color(us); + Square blockSq = s + pawn_push(Us); - if ( relative_rank(us, s) == RANK_7 - && relative_rank(us, pos.king_square(them)) == RANK_8) - { - ei.mgValue += Sign[us] * (Piece == ROOK ? MidgameRookOn7thBonus : MidgameQueenOn7thBonus); - ei.egValue += Sign[us] * (Piece == ROOK ? EndgameRookOn7thBonus : EndgameQueenOn7thBonus); - } - } + // 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; - // Special extra evaluation for rooks - if (Piece == ROOK) - { - // Open and half-open files - f = square_file(s); - if (ei.pi->file_is_half_open(us, f)) + // 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 the pawn is free to advance, then increase the bonus + if (pos.empty(blockSq)) { - if (ei.pi->file_is_half_open(them, f)) - { - ei.mgValue += Sign[us] * RookOpenFileBonus; - ei.egValue += Sign[us] * RookOpenFileBonus; - } - else - { - ei.mgValue += Sign[us] * RookHalfOpenFileBonus; - ei.egValue += Sign[us] * RookHalfOpenFileBonus; - } - } + // 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); - // Penalize rooks which are trapped inside a king. Penalize more if - // king has lost right to castle. - if (mob > 6 || ei.pi->file_is_half_open(us, f)) - continue; + Bitboard bb = forward_bb(Them, s) & pos.pieces(ROOK, QUEEN) & pos.attacks_from(s); - ksq = pos.king_square(us); + if (!(pos.pieces(Us) & bb)) + defendedSquares &= ei.attackedBy[Us][ALL_PIECES]; - if ( square_file(ksq) >= FILE_E - && square_file(s) > square_file(ksq) - && (relative_rank(us, ksq) == RANK_1 || square_rank(ksq) == square_rank(s))) - { - // Is there a half-open file between the king and the edge of the board? - if (!ei.pi->has_open_file_to_right(us, square_file(ksq))) - ei.mgValue -= pos.can_castle(us)? Sign[us] * ((TrappedRookPenalty - mob * 16) / 2) - : Sign[us] * (TrappedRookPenalty - mob * 16); - } - else if ( square_file(ksq) <= FILE_D - && square_file(s) < square_file(ksq) - && (relative_rank(us, ksq) == RANK_1 || square_rank(ksq) == square_rank(s))) - { - // Is there a half-open file between the king and the edge of the board? - if (!ei.pi->has_open_file_to_left(us, square_file(ksq))) - ei.mgValue -= pos.can_castle(us)? Sign[us] * ((TrappedRookPenalty - mob * 16) / 2) - : Sign[us] * (TrappedRookPenalty - mob * 16); - } - } - } - } + if (!(pos.pieces(Them) & bb)) + unsafeSquares &= ei.attackedBy[Them][ALL_PIECES] | pos.pieces(Them); - inline Bitboard shiftRowsDown(const Bitboard& b, int num) { + // 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; - return b >> (num << 3); - } + // If the path to queen is fully defended, assign a big bonus. + // Otherwise assign a smaller bonus if the block square is defended. + if (defendedSquares == squaresToQueen) + k += 6; - // evaluate_pieces() assigns bonuses and penalties to a king of a given - // color. + else if (defendedSquares & blockSq) + k += 4; - template<> - void evaluate_pieces(const Position& p, Color us, EvalInfo& ei) { + mbonus += k * rr, ebonus += k * rr; + } + else if (pos.pieces(Us) & blockSq) + mbonus += rr * 3 + r * 2 + 3, ebonus += rr + r * 2; + } // rr != 0 - int shelter = 0, sign = Sign[us]; - Square s = p.king_square(us); + if (pos.count(Us) < pos.count(Them)) + ebonus += ebonus / 4; - // King shelter - if (relative_rank(us, s) <= RANK_4) - { - // Shelter cache lookup - shelter = ei.pi->kingShelter(us, s); - if (shelter == -1) - { - shelter = 0; - Bitboard pawns = p.pawns(us) & this_and_neighboring_files_bb(s); - Rank r = square_rank(s); - for (int i = 1; i < 4; i++) - shelter += count_1s_8bit(shiftRowsDown(pawns, r+i*sign)) * (128>>i); - - // Cache shelter value in pawn info - ei.pi->setKingShelter(us, s, shelter); - } - ei.mgValue += sign * Value(shelter); + score += make_score(mbonus, ebonus); } - // King safety. This is quite complicated, and is almost certainly far - // from optimally tuned. - Color them = opposite_color(us); + if (Trace) + Tracing::write(Tracing::PASSED, Us, apply_weight(score, Weights[PassedPawns])); - if ( p.piece_count(them, QUEEN) >= 1 - && ei.kingAttackersCount[them] >= 2 - && p.non_pawn_material(them) >= QueenValueMidgame + RookValueMidgame - && ei.kingAdjacentZoneAttacksCount[them]) - { - // Is it the attackers turn to move? - bool sente = (them == p.side_to_move()); - - // Find the attacked squares around the king which has no defenders - // apart from the king itself - Bitboard undefended = - ei.attacked_by(them) & ~ei.attacked_by(us, PAWN) - & ~ei.attacked_by(us, KNIGHT) & ~ei.attacked_by(us, BISHOP) - & ~ei.attacked_by(us, ROOK) & ~ei.attacked_by(us, QUEEN) - & ei.attacked_by(us, KING); - - Bitboard occ = p.occupied_squares(), b, b2; - - // Initialize the 'attackUnits' variable, which is used later on as an - // index to the SafetyTable[] array. The initial value is based on the - // number and types of the attacking pieces, the number of attacked and - // undefended squares around the king, the square of the king, and the - // quality of the pawn shelter. - int attackUnits = - Min((ei.kingAttackersCount[them] * ei.kingAttackersWeight[them]) / 2, 25) - + (ei.kingAdjacentZoneAttacksCount[them] + count_1s_max_15(undefended)) * 3 - + InitKingDanger[relative_square(us, s)] - (shelter >> 5); - - // Analyse safe queen contact checks - b = undefended & ei.attacked_by(them, QUEEN) & ~p.pieces_of_color(them); - if (b) - { - Bitboard attackedByOthers = - ei.attacked_by(them, PAWN) | ei.attacked_by(them, KNIGHT) - | ei.attacked_by(them, BISHOP) | ei.attacked_by(them, ROOK); - - b &= attackedByOthers; - if (b) - { - // The bitboard b now contains the squares available for safe queen - // contact checks. - int count = count_1s_max_15(b); - attackUnits += QueenContactCheckBonus * count * (sente ? 2 : 1); - - // Is there a mate threat? - if (QueenContactMates && !p.is_check()) - { - Bitboard escapeSquares = - p.piece_attacks(s) & ~p.pieces_of_color(us) & ~attackedByOthers; - - while (b) - { - Square from, to = pop_1st_bit(&b); - if (!(escapeSquares & ~queen_attacks_bb(to, occ & ClearMaskBB[s]))) - { - // We have a mate, unless the queen is pinned or there - // is an X-ray attack through the queen. - for (int i = 0; i < p.piece_count(them, QUEEN); i++) - { - from = p.piece_list(them, QUEEN, i); - if ( bit_is_set(p.piece_attacks(from), to) - && !bit_is_set(p.pinned_pieces(them), from) - && !(rook_attacks_bb(to, occ & ClearMaskBB[from]) & p.rooks_and_queens(us)) - && !(bishop_attacks_bb(to, occ & ClearMaskBB[from]) & p.bishops_and_queens(us))) - - ei.mateThreat[them] = make_move(from, to); - } - } - } - } - } - } - - // Analyse safe distance checks - if (QueenCheckBonus > 0 || RookCheckBonus > 0) - { - b = p.piece_attacks(s) & ~p.pieces_of_color(them) & ~ei.attacked_by(us); - - // Queen checks - b2 = b & ei.attacked_by(them, QUEEN); - if( b2) - attackUnits += QueenCheckBonus * count_1s_max_15(b2); - - // Rook checks - b2 = b & ei.attacked_by(them, ROOK); - if (b2) - attackUnits += RookCheckBonus * count_1s_max_15(b2); - } - if (QueenCheckBonus > 0 || BishopCheckBonus > 0) - { - b = p.piece_attacks(s) & ~p.pieces_of_color(them) & ~ei.attacked_by(us); - - // Queen checks - b2 = b & ei.attacked_by(them, QUEEN); - if (b2) - attackUnits += QueenCheckBonus * count_1s_max_15(b2); - - // Bishop checks - b2 = b & ei.attacked_by(them, BISHOP); - if (b2) - attackUnits += BishopCheckBonus * count_1s_max_15(b2); - } - if (KnightCheckBonus > 0) - { - b = p.piece_attacks(s) & ~p.pieces_of_color(them) & ~ei.attacked_by(us); - - // Knight checks - b2 = b & ei.attacked_by(them, KNIGHT); - if (b2) - attackUnits += KnightCheckBonus * count_1s_max_15(b2); - } - - // Analyse discovered checks (only for non-pawns right now, consider - // adding pawns later). - if (DiscoveredCheckBonus) - { - b = p.discovered_check_candidates(them) & ~p.pawns(); - if (b) - attackUnits += DiscoveredCheckBonus * count_1s_max_15(b) * (sente? 2 : 1); - } - - // Has a mate threat been found? We don't do anything here if the - // side with the mating move is the side to move, because in that - // case the mating side will get a huge bonus at the end of the main - // evaluation function instead. - if (ei.mateThreat[them] != MOVE_NONE) - attackUnits += MateThreatBonus; - - // Ensure that attackUnits is between 0 and 99, in order to avoid array - // out of bounds errors: - if (attackUnits < 0) - attackUnits = 0; - - if (attackUnits >= 100) - attackUnits = 99; - - // Finally, extract the king safety score from the SafetyTable[] array. - // Add the score to the evaluation, and also to ei.futilityMargin. The - // reason for adding the king safety score to the futility margin is - // that the king safety scores can sometimes be very big, and that - // capturing a single attacking piece can therefore result in a score - // change far bigger than the value of the captured piece. - Value v = apply_weight(SafetyTable[attackUnits], WeightKingSafety[us]); - - ei.mgValue -= sign * v; - - if (us == p.side_to_move()) - ei.futilityMargin += v; - } + // Add the scores to the middlegame and endgame eval + return apply_weight(score, Weights[PassedPawns]); } - // evaluate_passed_pawns() evaluates the passed pawns for both sides. + // evaluate_space() computes the space evaluation for a given side. The + // space evaluation is a simple bonus based on the number of safe squares + // available for minor pieces on the central four files on ranks 2--4. Safe + // squares one, two or three squares behind a friendly pawn are counted + // twice. Finally, the space bonus is multiplied by a weight. The aim is to + // improve play on game opening. + template + Score evaluate_space(const Position& pos, const EvalInfo& ei) { - void evaluate_passed_pawns(const Position &pos, EvalInfo &ei) { + const Color Them = (Us == WHITE ? BLACK : WHITE); - bool hasUnstoppable[2] = {false, false}; - int movesToGo[2] = {100, 100}; + // 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] + & ~pos.pieces(Us, PAWN) + & ~ei.attackedBy[Them][PAWN] + & (ei.attackedBy[Us][ALL_PIECES] | ~ei.attackedBy[Them][ALL_PIECES]); - for (Color us = WHITE; us <= BLACK; us++) - { - Color them = opposite_color(us); - Square ourKingSq = pos.king_square(us); - Square theirKingSq = pos.king_square(them); - Bitboard b = ei.pi->passed_pawns() & pos.pawns(us), b2, b3, b4; + // 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); - while (b) - { - Square s = pop_1st_bit(&b); + // Since SpaceMask[Us] is fully on our half of the board + assert(unsigned(safe >> (Us == WHITE ? 32 : 0)) == 0); - assert(pos.piece_on(s) == piece_of_color_and_type(us, PAWN)); - assert(pos.pawn_is_passed(us, s)); + // Count safe + (behind & safe) with a single popcount + int bonus = popcount((Us == WHITE ? safe << 32 : safe >> 32) | (behind & safe)); + int weight = pos.count(Us) + pos.count(Us) + + pos.count(Them) + pos.count(Them); - int r = int(relative_rank(us, s) - RANK_2); - int tr = Max(0, r * (r - 1)); - Square blockSq = s + pawn_push(us); + return make_score(bonus * weight * weight, 0); + } - // Base bonus based on rank - Value mbonus = Value(20 * tr); - Value ebonus = Value(10 + r * r * 10); - // Adjust bonus based on king proximity - if (tr != 0) - { - ebonus -= Value(square_distance(ourKingSq, blockSq) * 3 * tr); - ebonus -= Value(square_distance(ourKingSq, blockSq + pawn_push(us)) * 1 * tr); - ebonus += Value(square_distance(theirKingSq, blockSq) * 6 * tr); - - // If the pawn is free to advance, increase bonus - if (pos.square_is_empty(blockSq)) - { - b2 = squares_in_front_of(us, s); - b3 = b2 & ei.attacked_by(them); - b4 = b2 & ei.attacked_by(us); - - // If there is an enemy rook or queen attacking the pawn from behind, - // add all X-ray attacks by the rook or queen. - if ( bit_is_set(ei.attacked_by(them,ROOK) | ei.attacked_by(them,QUEEN),s) - && (squares_behind(us, s) & pos.rooks_and_queens(them))) - b3 = b2; - - if ((b2 & pos.pieces_of_color(them)) == EmptyBoardBB) - { - // There are no enemy pieces in the pawn's path! Are any of the - // squares in the pawn's path attacked by the enemy? - if (b3 == EmptyBoardBB) - // No enemy attacks, huge bonus! - ebonus += Value(tr * (b2 == b4 ? 17 : 15)); - else - // OK, there are enemy attacks. Are those squares which are - // attacked by the enemy also attacked by us? If yes, big bonus - // (but smaller than when there are no enemy attacks), if no, - // somewhat smaller bonus. - ebonus += Value(tr * ((b3 & b4) == b3 ? 13 : 8)); - } - else - { - // There are some enemy pieces in the pawn's path. While this is - // sad, we still assign a moderate bonus if all squares in the path - // which are either occupied by or attacked by enemy pieces are - // also attacked by us. - if (((b3 | (b2 & pos.pieces_of_color(them))) & ~b4) == EmptyBoardBB) - ebonus += Value(tr * 6); - } - // At last, add a small bonus when there are no *friendly* pieces - // in the pawn's path. - if ((b2 & pos.pieces_of_color(us)) == EmptyBoardBB) - ebonus += Value(tr); - } - } + // do_evaluate() is the evaluation entry point, called directly from evaluate() - // If the pawn is supported by a friendly pawn, increase bonus - b2 = pos.pawns(us) & neighboring_files_bb(s); - if (b2 & rank_bb(s)) - ebonus += Value(r * 20); - else if (pos.pawn_attacks(them, s) & b2) - ebonus += Value(r * 12); + template + Value do_evaluate(const Position& pos) { - // If the other side has only a king, check whether the pawn is - // unstoppable - if (pos.non_pawn_material(them) == Value(0)) - { - Square qsq; - int d; - - qsq = relative_square(us, make_square(square_file(s), RANK_8)); - d = square_distance(s, qsq) - - square_distance(theirKingSq, qsq) - + (us != pos.side_to_move()); - - if (d < 0) - { - int mtg = RANK_8 - relative_rank(us, s); - int blockerCount = count_1s_max_15(squares_in_front_of(us,s) & pos.occupied_squares()); - mtg += blockerCount; - d += blockerCount; - if (d < 0) - { - hasUnstoppable[us] = true; - movesToGo[us] = Min(movesToGo[us], mtg); - } - } - } - // Rook pawns are a special case: They are sometimes worse, and - // sometimes better than other passed pawns. It is difficult to find - // good rules for determining whether they are good or bad. For now, - // we try the following: Increase the value for rook pawns if the - // other side has no pieces apart from a knight, and decrease the - // value if the other side has a rook or queen. - if (square_file(s) == FILE_A || square_file(s) == FILE_H) - { - if( pos.non_pawn_material(them) <= KnightValueMidgame - && pos.piece_count(them, KNIGHT) <= 1) - ebonus += ebonus / 4; - else if(pos.rooks_and_queens(them)) - ebonus -= ebonus / 4; - } + assert(!pos.checkers()); - // Add the scores for this pawn to the middle game and endgame eval. - ei.mgValue += apply_weight(Sign[us] * mbonus, WeightPassedPawnsMidgame); - ei.egValue += apply_weight(Sign[us] * ebonus, WeightPassedPawnsEndgame); - } - } + EvalInfo ei; + Score score, mobility[2] = { SCORE_ZERO, SCORE_ZERO }; - // Does either side have an unstoppable passed pawn? - if (hasUnstoppable[WHITE] && !hasUnstoppable[BLACK]) - ei.egValue += UnstoppablePawnValue - Value(0x40 * movesToGo[WHITE]); - else if (hasUnstoppable[BLACK] && !hasUnstoppable[WHITE]) - ei.egValue -= UnstoppablePawnValue - Value(0x40 * movesToGo[BLACK]); - else if (hasUnstoppable[BLACK] && hasUnstoppable[WHITE]) - { - // Both sides have unstoppable pawns! Try to find out who queens - // first. We begin by transforming 'movesToGo' to the number of - // plies until the pawn queens for both sides. - movesToGo[WHITE] *= 2; - movesToGo[BLACK] *= 2; - movesToGo[pos.side_to_move()]--; - - // If one side queens at least three plies before the other, that - // side wins. - if (movesToGo[WHITE] <= movesToGo[BLACK] - 3) - ei.egValue += UnstoppablePawnValue - Value(0x40 * (movesToGo[WHITE]/2)); - else if(movesToGo[BLACK] <= movesToGo[WHITE] - 3) - ei.egValue -= UnstoppablePawnValue - Value(0x40 * (movesToGo[BLACK]/2)); - - // We could also add some rules about the situation when one side - // queens exactly one ply before the other: Does the first queen - // check the opponent's king, or attack the opponent's queening square? - // This is slightly tricky to get right, because it is possible that - // the opponent's king has moved somewhere before the first pawn queens. - } - } + // 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(); + // Probe the material hash table + ei.mi = Material::probe(pos); + score += ei.mi->imbalance(); - // evaluate_trapped_bishop_a7h7() determines whether a bishop on a7/h7 - // (a2/h2 for black) is trapped by enemy pawns, and assigns a penalty - // if it is. + // 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); - void evaluate_trapped_bishop_a7h7(const Position &pos, Square s, Color us, - EvalInfo &ei) { - assert(square_is_ok(s)); - assert(pos.piece_on(s) == piece_of_color_and_type(us, BISHOP)); + // Probe the pawn hash table + ei.pi = Pawns::probe(pos); + score += apply_weight(ei.pi->pawns_score(), Weights[PawnStructure]); - Square b6 = relative_square(us, (square_file(s) == FILE_A) ? SQ_B6 : SQ_G6); - Square b8 = relative_square(us, (square_file(s) == FILE_A) ? SQ_B8 : SQ_G8); + // Initialize attack and king safety bitboards + init_eval_info(pos, ei); + init_eval_info(pos, ei); - if ( pos.piece_on(b6) == piece_of_color_and_type(opposite_color(us), PAWN) - && pos.see(s, b6) < 0 - && pos.see(s, b8) < 0) - { - ei.mgValue -= Sign[us] * TrappedBishopA7H7Penalty; - ei.egValue -= Sign[us] * TrappedBishopA7H7Penalty; - } - } + ei.attackedBy[WHITE][ALL_PIECES] |= ei.attackedBy[WHITE][KING]; + ei.attackedBy[BLACK][ALL_PIECES] |= ei.attackedBy[BLACK][KING]; + + // 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)) }; + // Evaluate pieces and mobility + score += evaluate_pieces(pos, ei, mobility, mobilityArea); + score += apply_weight(mobility[WHITE] - mobility[BLACK], Weights[Mobility]); - // evaluate_trapped_bishop_a1h1() determines whether a bishop on a1/h1 - // (a8/h8 for black) is trapped by a friendly pawn on b2/g2 (b7/g7 for - // black), and assigns a penalty if it is. This pattern can obviously - // only occur in Chess960 games. + // Evaluate kings after all other pieces because we need complete attack + // information when computing the king safety evaluation. + score += evaluate_king(pos, ei) + - evaluate_king(pos, ei); - void evaluate_trapped_bishop_a1h1(const Position &pos, Square s, Color us, - EvalInfo &ei) { - Piece pawn = piece_of_color_and_type(us, PAWN); - Square b2, b3, c3; + // Evaluate tactical threats, we need full attack information including king + score += evaluate_threats(pos, ei) + - evaluate_threats(pos, ei); - assert(Chess960); - assert(square_is_ok(s)); - assert(pos.piece_on(s) == piece_of_color_and_type(us, BISHOP)); + // Evaluate passed pawns, we need full attack information including king + score += evaluate_passed_pawns(pos, ei) + - evaluate_passed_pawns(pos, ei); - if (square_file(s) == FILE_A) + // If both sides have only pawns, score for potential unstoppable pawns + if (!pos.non_pawn_material(WHITE) && !pos.non_pawn_material(BLACK)) { - b2 = relative_square(us, SQ_B2); - b3 = relative_square(us, SQ_B3); - c3 = relative_square(us, SQ_C3); + Bitboard b; + if ((b = ei.pi->passed_pawns(WHITE)) != 0) + score += int(relative_rank(WHITE, frontmost_sq(WHITE, b))) * Unstoppable; + + if ((b = ei.pi->passed_pawns(BLACK)) != 0) + score -= int(relative_rank(BLACK, frontmost_sq(BLACK, b))) * Unstoppable; } - else + + // 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) { - b2 = relative_square(us, SQ_G2); - b3 = relative_square(us, SQ_G3); - c3 = relative_square(us, SQ_F3); + Score s = evaluate_space(pos, ei) - evaluate_space(pos, ei); + score += apply_weight(s, Weights[Space]); } - if (pos.piece_on(b2) == pawn) + // 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); + + // 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)) { - Value penalty; + 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. + if ( pos.non_pawn_material(WHITE) == BishopValueMg + && pos.non_pawn_material(BLACK) == BishopValueMg) + sf = more_than_one(pos.pieces(PAWN)) ? ScaleFactor(32) : ScaleFactor(8); + + // 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); + } + // 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); + } - if (!pos.square_is_empty(b3)) - penalty = 2*TrappedBishopA1H1Penalty; - else if (pos.piece_on(c3) == pawn) - penalty = TrappedBishopA1H1Penalty; - else - penalty = TrappedBishopA1H1Penalty / 2; + // 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; + + v /= int(PHASE_MIDGAME); - ei.mgValue -= Sign[us] * penalty; - ei.egValue -= Sign[us] * penalty; + // 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(pos, ei), Weights[Space]) + , apply_weight(evaluate_space(pos, ei), Weights[Space])); + Tracing::write(Tracing::TOTAL, score); + Tracing::ei = ei; + Tracing::sf = sf; } + + return (pos.side_to_move() == WHITE ? v : -v) + Eval::Tempo; } - // evaluate_space() computes the space evaluation for a given side. The - // space evaluation is a simple bonus based on the number of safe squares - // available for minor pieces on the central four files on ranks 2--4. Safe - // squares one, two or three squares behind a friendly pawn are counted - // twice. Finally, the space bonus is scaled by a weight taken from the - // material hash table. + // Tracing function definitions - void evaluate_space(const Position &pos, Color us, EvalInfo &ei) { + double Tracing::to_cp(Value v) { return double(v) / PawnValueEg; } - Color them = opposite_color(us); + void Tracing::write(int idx, Color c, Score s) { scores[c][idx] = s; } - // Find the safe squares for our pieces inside the area defined by - // SpaceMask[us]. A square is unsafe it is attacked by an enemy - // pawn, or if it is undefended and attacked by an enemy piece. + void Tracing::write(int idx, Score w, Score b) { - Bitboard safeSquares = SpaceMask[us] - & ~pos.pawns(us) - & ~ei.attacked_by(them, PAWN) - & ~(~ei.attacked_by(us) & ei.attacked_by(them)); + write(idx, WHITE, w); + write(idx, BLACK, b); + } - // Find all squares which are at most three squares behind some friendly - // pawn. - Bitboard behindFriendlyPawns = pos.pawns(us); - if (us == WHITE) - { - behindFriendlyPawns |= (behindFriendlyPawns >> 8); - behindFriendlyPawns |= (behindFriendlyPawns >> 16); + 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"; } - else - { - behindFriendlyPawns |= (behindFriendlyPawns << 8); - behindFriendlyPawns |= (behindFriendlyPawns << 16); - } - - int space = count_1s_max_15(safeSquares) - + count_1s_max_15(behindFriendlyPawns & safeSquares); - - ei.mgValue += Sign[us] * apply_weight(Value(space * ei.mi->space_weight()), WeightSpace); } + std::string Tracing::do_trace(const Position& pos) { - // apply_weight() applies an evaluation weight to a value + std::memset(scores, 0, sizeof(scores)); - inline Value apply_weight(Value v, int w) { - return (v*w) / 0x100; - } + Value v = do_evaluate(pos); + v = pos.side_to_move() == WHITE ? v : -v; // White's point of view + 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"; - // scale_by_game_phase() interpolates between a middle game and an endgame - // score, based on game phase. It also scales the return value by a - // ScaleFactor array. + 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); - Value scale_by_game_phase(Value mv, Value ev, Phase ph, const ScaleFactor sf[]) { + ss << "----------------+-------------+-------------+-------------\n"; + print(ss, "Total", TOTAL); - assert(mv > -VALUE_INFINITE && mv < VALUE_INFINITE); - assert(ev > -VALUE_INFINITE && ev < VALUE_INFINITE); - assert(ph >= PHASE_ENDGAME && ph <= PHASE_MIDGAME); + ss << "\nTotal Evaluation: " << to_cp(v) << " (white side)\n"; - ev = apply_scale_factor(ev, sf[(ev > Value(0) ? WHITE : BLACK)]); - - Value result = Value(int((mv * ph + ev * (128 - ph)) / 128)); - return Value(int(result) & ~(GrainSize - 1)); + return ss.str(); } - - // count_1s_8bit() counts the number of nonzero bits in the 8 least - // significant bits of a Bitboard. This function is used by the king - // shield evaluation. - - int count_1s_8bit(Bitboard b) { - return int(BitCount8Bit[b & 0xFF]); - } +} // namespace - // compute_weight() computes the value of an evaluation weight, by combining - // an UCI-configurable weight with an internal weight. +namespace Eval { - int compute_weight(int uciWeight, int internalWeight) { + /// 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. - uciWeight = (uciWeight * 0x100) / 100; - return (uciWeight * internalWeight) / 0x100; + Value evaluate(const Position& pos) { + return do_evaluate(pos); } - // helper used in read_weights() - int weight_option(const std::string& opt, int weight) { - - return compute_weight(get_option_value_int(opt), weight); + /// 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); } - // init_safety() initizes the king safety evaluation, based on UCI - // parameters. It is called from read_weights(). - - void init_safety() { + /// init() computes evaluation weights, usually at startup - QueenContactCheckBonus = get_option_value_int("Queen Contact Check Bonus"); - QueenCheckBonus = get_option_value_int("Queen Check Bonus"); - RookCheckBonus = get_option_value_int("Rook Check Bonus"); - BishopCheckBonus = get_option_value_int("Bishop Check Bonus"); - KnightCheckBonus = get_option_value_int("Knight Check Bonus"); - DiscoveredCheckBonus = get_option_value_int("Discovered Check Bonus"); - MateThreatBonus = get_option_value_int("Mate Threat Bonus"); + void init() { - int maxSlope = get_option_value_int("King Safety Max Slope"); - int peak = get_option_value_int("King Safety Max Value") * 256 / 100; - double a = get_option_value_int("King Safety Coefficient") / 100.0; - double b = get_option_value_int("King Safety X Intercept"); - bool quad = (get_option_value_string("King Safety Curve") == "Quadratic"); - bool linear = (get_option_value_string("King Safety Curve") == "Linear"); + const int MaxSlope = 8700; + const int Peak = 1280000; + int t = 0; - for (int i = 0; i < 100; i++) + for (int i = 0; i < 400; ++i) { - if (i < b) - SafetyTable[i] = Value(0); - else if(quad) - SafetyTable[i] = Value((int)(a * (i - b) * (i - b))); - else if(linear) - SafetyTable[i] = Value((int)(100 * a * (i - b))); - } - - for (int i = 0; i < 100; i++) - { - if (SafetyTable[i+1] - SafetyTable[i] > maxSlope) - for (int j = i + 1; j < 100; j++) - SafetyTable[j] = SafetyTable[j-1] + Value(maxSlope); - - if (SafetyTable[i] > Value(peak)) - SafetyTable[i] = Value(peak); + t = std::min(Peak, std::min(i * i * 27, t + MaxSlope)); + KingDanger[i] = apply_weight(make_score(t / 1000, 0), Weights[KingSafety]); } } -} + +} // namespace Eval