X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fevaluate.cpp;h=9c2b70a7acb90509200b56c42f1a287bb44155a2;hp=680b8e0fb58d163598b45a184eb3814f9edc4d0a;hb=18c9b5ee863bf4764ddb426b7d3b060683ff4710;hpb=45acec1865f19297d91c6aff0ba64b990ad7d242 diff --git a/src/evaluate.cpp b/src/evaluate.cpp index 680b8e0f..9c2b70a7 100644 --- a/src/evaluate.cpp +++ b/src/evaluate.cpp @@ -23,6 +23,9 @@ //// #include +#include +#include +#include #include "bitcount.h" #include "evaluate.h" @@ -219,22 +222,27 @@ namespace { // weighted scores, indexed by color and by a calculated integer number. Score KingDangerTable[2][128]; - // Pawn and material hash tables, indexed by the current thread id. - // Note that they will be initialized at 0 being global variables. - MaterialInfoTable* MaterialTable[MAX_THREADS]; - PawnInfoTable* PawnTable[MAX_THREADS]; + // TracedTerms[Color][PieceType || TracedType] contains a breakdown of the + // evaluation terms, used when tracing. + Score TracedTerms[2][16]; + std::stringstream TraceStream; + + enum TracedType { + PST = 8, IMBALANCE = 9, MOBILITY = 10, THREAT = 11, + PASSED = 12, UNSTOPPABLE = 13, SPACE = 14, TOTAL = 15 + }; // Function prototypes - template + template Value do_evaluate(const Position& pos, Value& margin); template void init_eval_info(const Position& pos, EvalInfo& ei); - template + template Score evaluate_pieces_of_color(const Position& pos, EvalInfo& ei, Score& mobility); - template + template Score evaluate_king(const Position& pos, EvalInfo& ei, Value margins[]); template @@ -256,31 +264,26 @@ namespace { } -//// -//// Functions -//// - - -/// Prefetches in pawn hash tables - -void prefetchPawn(Key key, int threadID) { - - PawnTable[threadID]->prefetch(key); -} - - /// 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. Value evaluate(const Position& pos, Value& margin) { - return CpuHasPOPCNT ? do_evaluate(pos, margin) - : do_evaluate(pos, margin); + return CpuHasPOPCNT ? do_evaluate(pos, margin) + : do_evaluate(pos, margin); } namespace { -template +double to_cp(Value v) { return double(v) / double(PawnValueMidgame); } + +void trace_add(int idx, Score term_w, Score term_b = Score(0)) { + + TracedTerms[WHITE][idx] = term_w; + TracedTerms[BLACK][idx] = term_b; +} + +template Value do_evaluate(const Position& pos, Value& margin) { EvalInfo ei; @@ -289,7 +292,7 @@ Value do_evaluate(const Position& pos, Value& margin) { assert(pos.is_ok()); assert(pos.thread() >= 0 && pos.thread() < MAX_THREADS); - assert(!pos.is_check()); + assert(!pos.in_check()); // Initialize value by reading the incrementally updated scores included // in the position object (material + piece square tables). @@ -300,7 +303,7 @@ Value do_evaluate(const Position& pos, Value& margin) { margins[WHITE] = margins[BLACK] = VALUE_ZERO; // Probe the material hash table - MaterialInfo* mi = MaterialTable[pos.thread()]->get_material_info(pos); + MaterialInfo* mi = Threads[pos.thread()].materialTable.get_material_info(pos); bonus += mi->material_value(); // If we have a specialized evaluation function for the current material @@ -312,7 +315,7 @@ Value do_evaluate(const Position& pos, Value& margin) { } // Probe the pawn hash table - ei.pi = PawnTable[pos.thread()]->get_pawn_info(pos); + ei.pi = Threads[pos.thread()].pawnTable.get_pawn_info(pos); bonus += apply_weight(ei.pi->pawns_value(), Weights[PawnStructure]); // Initialize attack and king safety bitboards @@ -320,15 +323,15 @@ Value do_evaluate(const Position& pos, Value& margin) { init_eval_info(pos, ei); // Evaluate pieces and mobility - bonus += evaluate_pieces_of_color(pos, ei, mobilityWhite) - - evaluate_pieces_of_color(pos, ei, mobilityBlack); + bonus += evaluate_pieces_of_color(pos, ei, mobilityWhite) + - evaluate_pieces_of_color(pos, ei, mobilityBlack); bonus += apply_weight(mobilityWhite - mobilityBlack, Weights[Mobility]); // Evaluate kings after all other pieces because we need complete attack // information when computing the king safety evaluation. - bonus += evaluate_king(pos, ei, margins) - - evaluate_king(pos, ei, margins); + bonus += evaluate_king(pos, ei, margins) + - evaluate_king(pos, ei, margins); // Evaluate tactical threats, we need full attack information including king bonus += evaluate_threats(pos, ei) @@ -345,8 +348,13 @@ Value do_evaluate(const Position& pos, Value& margin) { // Evaluate space for both sides, only in middle-game. if (mi->space_weight()) { - int s = evaluate_space(pos, ei) - evaluate_space(pos, ei); - bonus += apply_weight(make_score(s * mi->space_weight(), 0), Weights[Space]); + int s_w = evaluate_space(pos, ei); + int s_b = evaluate_space(pos, ei); + bonus += apply_weight(make_score((s_w - s_b) * mi->space_weight(), 0), Weights[Space]); + + if (Trace) + trace_add(SPACE, apply_weight(make_score(s_w * mi->space_weight(), make_score(0, 0)), Weights[Space]), + apply_weight(make_score(s_b * mi->space_weight(), make_score(0, 0)), Weights[Space])); } // Scale winning side if position is more drawish that what it appears @@ -378,44 +386,31 @@ Value do_evaluate(const Position& pos, Value& margin) { // Interpolate between the middle game and the endgame score margin = margins[pos.side_to_move()]; Value v = scale_by_game_phase(bonus, phase, sf); - return pos.side_to_move() == WHITE ? v : -v; -} -} // namespace - - -/// init_eval() initializes various tables used by the evaluation function - -void init_eval(int threads) { - - assert(threads <= MAX_THREADS); - - for (int i = 0; i < MAX_THREADS; i++) + if (Trace) { - if (i >= threads) - { - delete PawnTable[i]; - delete MaterialTable[i]; - PawnTable[i] = NULL; - MaterialTable[i] = NULL; - continue; - } - if (!PawnTable[i]) - PawnTable[i] = new PawnInfoTable(); - - if (!MaterialTable[i]) - MaterialTable[i] = new MaterialInfoTable(); + trace_add(PST, pos.value()); + trace_add(IMBALANCE, mi->material_value()); + trace_add(PAWN, apply_weight(ei.pi->pawns_value(), Weights[PawnStructure])); + trace_add(MOBILITY, apply_weight(mobilityWhite, Weights[Mobility]), apply_weight(mobilityBlack, Weights[Mobility])); + trace_add(THREAT, evaluate_threats(pos, ei), evaluate_threats(pos, ei)); + trace_add(PASSED, evaluate_passed_pawns(pos, ei), evaluate_passed_pawns(pos, ei)); + trace_add(UNSTOPPABLE, evaluate_unstoppable_pawns(pos, ei)); + trace_add(TOTAL, bonus); + TraceStream << "\nUncertainty margin: White: " << to_cp(margins[WHITE]) + << ", Black: " << to_cp(margins[BLACK]) + << "\nScaling: " << std::noshowpos + << std::setw(6) << 100.0 * phase/128.0 << "% MG, " + << std::setw(6) << 100.0 * (1.0 - phase/128.0) << "% * " + << std::setw(6) << (100.0 * sf) / SCALE_FACTOR_NORMAL << "% EG.\n" + << "Total evaluation: " << to_cp(v); } -} - -/// quit_eval() releases heap-allocated memory at program termination - -void quit_eval() { - - init_eval(0); + return pos.side_to_move() == WHITE ? v : -v; } +} // namespace + /// read_weights() reads evaluation weights from the corresponding UCI parameters @@ -497,7 +492,7 @@ namespace { // evaluate_pieces<>() assigns bonuses and penalties to the pieces of a given color - template + template Score evaluate_pieces(const Position& pos, EvalInfo& ei, Score& mobility, Bitboard mobilityArea) { Bitboard b; @@ -569,13 +564,12 @@ namespace { // problem, especially when that pawn is also blocked. if (s == relative_square(Us, SQ_A1) || s == relative_square(Us, SQ_H1)) { - SquareDelta d = pawn_push(Us) - + (square_file(s) == FILE_A ? DELTA_E : DELTA_W); - if (pos.piece_on(s + d) == piece_of_color_and_type(Us, PAWN)) + Square d = pawn_push(Us) + (square_file(s) == FILE_A ? DELTA_E : DELTA_W); + if (pos.piece_on(s + d) == make_piece(Us, PAWN)) { if (!pos.square_is_empty(s + d + pawn_push(Us))) bonus -= 2*TrappedBishopA1H1Penalty; - else if (pos.piece_on(s + 2*d) == piece_of_color_and_type(Us, PAWN)) + else if (pos.piece_on(s + 2*d) == make_piece(Us, PAWN)) bonus -= TrappedBishopA1H1Penalty; else bonus -= TrappedBishopA1H1Penalty / 2; @@ -623,6 +617,10 @@ namespace { } } } + + if (Trace) + TracedTerms[Us][Piece] = bonus; + return bonus; } @@ -663,7 +661,7 @@ namespace { // evaluate_pieces_of_color<>() assigns bonuses and penalties to all the // pieces of a given color. - template + template Score evaluate_pieces_of_color(const Position& pos, EvalInfo& ei, Score& mobility) { const Color Them = (Us == WHITE ? BLACK : WHITE); @@ -673,10 +671,10 @@ namespace { // Do not include in mobility squares protected by enemy pawns or occupied by our pieces const Bitboard mobilityArea = ~(ei.attackedBy[Them][PAWN] | pos.pieces_of_color(Us)); - bonus += evaluate_pieces(pos, ei, mobility, mobilityArea); - bonus += evaluate_pieces(pos, ei, mobility, mobilityArea); - bonus += evaluate_pieces(pos, ei, mobility, mobilityArea); - bonus += evaluate_pieces(pos, ei, mobility, mobilityArea); + bonus += evaluate_pieces(pos, ei, mobility, mobilityArea); + bonus += evaluate_pieces(pos, ei, mobility, mobilityArea); + bonus += evaluate_pieces(pos, ei, mobility, mobilityArea); + bonus += evaluate_pieces(pos, ei, mobility, mobilityArea); // Sum up all attacked squares ei.attackedBy[Us][0] = ei.attackedBy[Us][PAWN] | ei.attackedBy[Us][KNIGHT] @@ -688,7 +686,7 @@ namespace { // evaluate_king<>() assigns bonuses and penalties to a king of a given color - template + template Score evaluate_king(const Position& pos, EvalInfo& ei, Value margins[]) { const BitCountType Max15 = HasPopCnt ? CNT_POPCNT : CpuIs64Bit ? CNT64_MAX15 : CNT32_MAX15; @@ -792,6 +790,10 @@ namespace { bonus -= KingDangerTable[Us][attackUnits]; margins[Us] += mg_value(KingDangerTable[Us][attackUnits]); } + + if (Trace) + TracedTerms[Us][KING] = bonus; + return bonus; } @@ -893,166 +895,171 @@ namespace { return apply_weight(bonus, Weights[PassedPawns]); } + // evaluate_unstoppable_pawns() evaluates the unstoppable passed pawns for both sides + template Score evaluate_unstoppable_pawns(const Position& pos, EvalInfo& ei) { const BitCountType Max15 = HasPopCnt ? CNT_POPCNT : CpuIs64Bit ? CNT64_MAX15 : CNT32_MAX15; + Bitboard b1, b2, queeningPath, candidates, supBB, sacBB; + Square s1, s2, queeningSquare, supSq, sacSq; + Color c, winnerSide, loserSide; + bool pathDefended, opposed; + int pliesToGo, movesToGo, oppMovesToGo; + int pliesToQueen[] = { 256, 256 }; + // Step 1. Hunt for unstoppable pawns. If we find at least one, record how many plies // are required for promotion - int pliesToGo[2] = {256, 256}; - - for (Color c = WHITE; c <= BLACK; c++) + for (c = WHITE; c <= BLACK; c++) { // Skip if other side has non-pawn pieces if (pos.non_pawn_material(opposite_color(c))) continue; - Bitboard b = ei.pi->passed_pawns(c); + b1 = ei.pi->passed_pawns(c); - while (b) + while (b1) { - Square s = pop_1st_bit(&b); - Square queeningSquare = relative_square(c, make_square(square_file(s), RANK_8)); + s1 = pop_1st_bit(&b1); + queeningSquare = relative_square(c, make_square(square_file(s1), RANK_8)); + queeningPath = squares_in_front_of(c, s1); - int mtg = RANK_8 - relative_rank(c, s) - int(relative_rank(c, s) == RANK_2); - int oppmtg = square_distance(pos.king_square(opposite_color(c)), queeningSquare) - int(c != pos.side_to_move()); - bool pathDefended = ((ei.attackedBy[c][0] & squares_in_front_of(c, s)) == squares_in_front_of(c, s)); + // Compute plies from queening and check direct advancement + movesToGo = rank_distance(s1, queeningSquare) - int(relative_rank(c, s1) == RANK_2); + oppMovesToGo = square_distance(pos.king_square(opposite_color(c)), queeningSquare) - int(c != pos.side_to_move()); + pathDefended = ((ei.attackedBy[c][0] & queeningPath) == queeningPath); - if (mtg >= oppmtg && !pathDefended) + if (movesToGo >= oppMovesToGo && !pathDefended) continue; - int blockerCount = count_1s(squares_in_front_of(c, s) & pos.occupied_squares()); - mtg += blockerCount; + // Opponent king cannot block because path is defended and position + // is not in check. So only friendly pieces can be blockers. + assert(!pos.in_check()); + assert(queeningPath & pos.occupied_squares() == queeningPath & pos.pieces_of_color(c)); + + // Add moves needed to free the path from friendly pieces and retest condition + movesToGo += count_1s(queeningPath & pos.pieces_of_color(c)); - if (mtg >= oppmtg && !pathDefended) + if (movesToGo >= oppMovesToGo && !pathDefended) continue; - int ptg = 2 * mtg - int(c == pos.side_to_move()); + pliesToGo = 2 * movesToGo - int(c == pos.side_to_move()); - if (ptg < pliesToGo[c]) - pliesToGo[c] = ptg; + if (pliesToGo < pliesToQueen[c]) + pliesToQueen[c] = pliesToGo; } } - // Step 2. If either side cannot promote at least three plies before the other side then - // situation becomes too complex and we give up. Otherwise we determine the possibly "winning side" - if (abs(pliesToGo[WHITE] - pliesToGo[BLACK]) < 3) - return make_score(0, 0); + // Step 2. If either side cannot promote at least three plies before the other side then situation + // becomes too complex and we give up. Otherwise we determine the possibly "winning side" + if (abs(pliesToQueen[WHITE] - pliesToQueen[BLACK]) < 3) + return SCORE_ZERO; - Color winnerSide = (pliesToGo[WHITE] < pliesToGo[BLACK] ? WHITE : BLACK); - Color loserSide = opposite_color(winnerSide); + winnerSide = (pliesToQueen[WHITE] < pliesToQueen[BLACK] ? WHITE : BLACK); + loserSide = opposite_color(winnerSide); // Step 3. Can the losing side possibly create a new passed pawn and thus prevent the loss? // We collect the potential candidates in potentialBB. - Bitboard pawnBB = pos.pieces(PAWN, loserSide); - Bitboard potentialBB = pawnBB; - const Bitboard passedBB = ei.pi->passed_pawns(loserSide); + b1 = candidates = pos.pieces(PAWN, loserSide); - while(pawnBB) + while (b1) { - Square psq = pop_1st_bit(&pawnBB); - - // Check direct advancement - int mtg = RANK_8 - relative_rank(loserSide, psq) - int(relative_rank(loserSide, psq) == RANK_2); - int ptg = 2 * mtg - int(loserSide == pos.side_to_move()); + s1 = pop_1st_bit(&b1); - // Check if (without even considering any obstacles) we're too far away - if (pliesToGo[winnerSide] + 3 <= ptg) - { - clear_bit(&potentialBB, psq); - continue; - } + // Compute plies from queening + queeningSquare = relative_square(loserSide, make_square(square_file(s1), RANK_8)); + movesToGo = rank_distance(s1, queeningSquare) - int(relative_rank(loserSide, s1) == RANK_2); + pliesToGo = 2 * movesToGo - int(loserSide == pos.side_to_move()); - // If this is passed pawn, then it _may_ promote in time. We give up. - if (bit_is_set(passedBB, psq)) - return make_score(0, 0); - - // Doubled pawn is worthless - if (squares_in_front_of(loserSide, psq) & (pos.pieces(PAWN, loserSide))) - { - clear_bit(&potentialBB, psq); - continue; - } + // Check if (without even considering any obstacles) we're too far away or doubled + if ( pliesToQueen[winnerSide] + 3 <= pliesToGo + || (squares_in_front_of(loserSide, s1) & pos.pieces(PAWN, loserSide))) + clear_bit(&candidates, s1); } - // Step 4. Check new passed pawn creation through king capturing and sacrifises - pawnBB = potentialBB; + // If any candidate is already a passed pawn it _may_ promote in time. We give up. + if (candidates & ei.pi->passed_pawns(loserSide)) + return SCORE_ZERO; - while(pawnBB) + // Step 4. Check new passed pawn creation through king capturing and sacrifices + b1 = candidates; + + while (b1) { - Square psq = pop_1st_bit(&pawnBB); + s1 = pop_1st_bit(&b1); - int mtg = RANK_8 - relative_rank(loserSide, psq) - int(relative_rank(loserSide, psq) == RANK_2); - int ptg = 2 * mtg - int(loserSide == pos.side_to_move()); + // Compute plies from queening + queeningSquare = relative_square(loserSide, make_square(square_file(s1), RANK_8)); + movesToGo = rank_distance(s1, queeningSquare) - int(relative_rank(loserSide, s1) == RANK_2); + pliesToGo = 2 * movesToGo - int(loserSide == pos.side_to_move()); // Generate list of obstacles - Bitboard obsBB = passed_pawn_mask(loserSide, psq) & pos.pieces(PAWN, winnerSide); - const bool pawnIsOpposed = squares_in_front_of(loserSide, psq) & obsBB; - assert(obsBB); + opposed = squares_in_front_of(loserSide, s1) & pos.pieces(PAWN, winnerSide); + b2 = passed_pawn_mask(loserSide, s1) & pos.pieces(PAWN, winnerSide); + + assert(b2); // How many plies does it take to remove all the obstacles? int sacptg = 0; int realObsCount = 0; int minKingDist = 256; + int kingptg = 256; - while(obsBB) + while (b2) { - Square obSq = pop_1st_bit(&obsBB); - int minMoves = 256; + s2 = pop_1st_bit(&b2); + movesToGo = 256; - // Check pawns that can give support to overcome obstacle (Eg. wp: a4,b4 bp: b2. b4 is giving support) - if (!pawnIsOpposed && square_file(psq) != square_file(obSq)) + // Check pawns that can give support to overcome obstacle, for instance + // black pawns: a4, b4 white: b2 then pawn in b4 is giving support. + if (!opposed && square_file(s1) != square_file(s2)) { - Bitboard supBB = in_front_bb(winnerSide, Square(obSq + (winnerSide == WHITE ? 8 : -8))) - & neighboring_files_bb(psq) & potentialBB; + supBB = in_front_bb(winnerSide, s2 + pawn_push(winnerSide)) & neighboring_files_bb(s1) & candidates; - while(supBB) // This while-loop could be replaced with supSq = LSB/MSB(supBB) (depending on color) + while (supBB) // This while-loop could be replaced with supSq = LSB/MSB(supBB) (depending on color) { - Square supSq = pop_1st_bit(&supBB); - int dist = square_distance(obSq, supSq); - minMoves = Min(minMoves, dist - 2); + supSq = pop_1st_bit(&supBB); + movesToGo = Min(movesToGo, square_distance(s2, supSq) - 2); } - } - // Check pawns that can be sacrifised - Bitboard sacBB = passed_pawn_mask(winnerSide, obSq) & neighboring_files_bb(obSq) & potentialBB & ~(1ULL << psq); + // Check pawns that can be sacrificed + sacBB = passed_pawn_mask(winnerSide, s2) & neighboring_files_bb(s2) & candidates & ~(1ULL << s1); - while(sacBB) // This while-loop could be replaced with sacSq = LSB/MSB(sacBB) (depending on color) + while (sacBB) // This while-loop could be replaced with sacSq = LSB/MSB(sacBB) (depending on color) { - Square sacSq = pop_1st_bit(&sacBB); - int dist = square_distance(obSq, sacSq); - minMoves = Min(minMoves, dist - 2); + sacSq = pop_1st_bit(&sacBB); + movesToGo = Min(movesToGo, square_distance(s2, sacSq) - 2); } - // If obstacle can be destroyed with immediate pawn sacrifise, it's not real obstacle - if (minMoves <= 0) + // Good, obstacle can be destroyed with an immediate pawn sacrifice, + // it's not a real obstacle and we have nothing to add to pliesToGo. + if (movesToGo <= 0) continue; - // Pawn sac calculations - sacptg += minMoves * 2; - - // King capture calc + // Plies needed to sacrifice the pawn + sacptg += movesToGo * 2; realObsCount++; - int kingDist = square_distance(pos.king_square(loserSide), obSq); - minKingDist = Min(minKingDist, kingDist); + + // Plies needed for the king to capture opposing pawn + minKingDist = Min(minKingDist, square_distance(pos.king_square(loserSide), s2)); + kingptg = (minKingDist + realObsCount) * 2; } - // Check if pawn sac plan _may_ save the day - if (pliesToGo[winnerSide] + 3 > ptg + sacptg) - return make_score(0, 0); + // Check if pawn sacrifice plan _may_ save the day + if (pliesToQueen[winnerSide] + 3 > pliesToGo + sacptg) + return SCORE_ZERO; // Check if king capture plan _may_ save the day (contains some false positives) - int kingptg = (minKingDist + realObsCount) * 2; - if (pliesToGo[winnerSide] + 3 > ptg + kingptg) - return make_score(0, 0); + if (pliesToQueen[winnerSide] + 3 > pliesToGo + kingptg) + return SCORE_ZERO; } - // Step 5. Assign bonus - const int Sign[2] = {1, -1}; - return Sign[winnerSide] * make_score(0, (Value) 0x500 - 0x20 * pliesToGo[winnerSide]); + // Winning pawn is unstoppable and will promote as first, return big score + Score score = make_score(0, (Value) 0x500 - 0x20 * pliesToQueen[winnerSide]); + return winnerSide == WHITE ? score : -score; } @@ -1102,11 +1109,9 @@ namespace { assert(eg_value(v) > -VALUE_INFINITE && eg_value(v) < VALUE_INFINITE); assert(ph >= PHASE_ENDGAME && ph <= PHASE_MIDGAME); - Value eg = eg_value(v); - Value ev = Value((eg * int(sf)) / SCALE_FACTOR_NORMAL); - + int ev = (eg_value(v) * int(sf)) / SCALE_FACTOR_NORMAL; int result = (mg_value(v) * int(ph) + ev * int(128 - ph)) / 128; - return Value(result & ~(GrainSize - 1)); + return Value((result + GrainSize / 2) & ~(GrainSize - 1)); } @@ -1148,4 +1153,75 @@ namespace { for (int i = 0; i < 100; i++) KingDangerTable[c][i] = apply_weight(make_score(t[i], 0), Weights[KingDangerUs + c]); } + + + // trace_row() is an helper function used by tracing code to register the + // values of a single evaluation term. + + void trace_row(const char *name, int idx) { + + Score term_w = TracedTerms[WHITE][idx]; + Score term_b = TracedTerms[BLACK][idx]; + + switch (idx) { + case PST: case IMBALANCE: case PAWN: case UNSTOPPABLE: case TOTAL: + TraceStream << std::setw(20) << name << " | --- --- | --- --- | " + << std::setw(6) << to_cp(mg_value(term_w)) << " " + << std::setw(6) << to_cp(eg_value(term_w)) << " \n"; + break; + default: + TraceStream << std::setw(20) << name << " | " << std::noshowpos + << std::setw(5) << to_cp(mg_value(term_w)) << " " + << std::setw(5) << to_cp(eg_value(term_w)) << " | " + << std::setw(5) << to_cp(mg_value(term_b)) << " " + << std::setw(5) << to_cp(eg_value(term_b)) << " | " + << std::showpos + << std::setw(6) << to_cp(mg_value(term_w - term_b)) << " " + << std::setw(6) << to_cp(eg_value(term_w - term_b)) << " \n"; + } + } +} + + +/// trace_evaluate() is like evaluate() but instead of a value returns a string +/// suitable to be print on stdout with the detailed descriptions and values of +/// each evaluation term. Used mainly for debugging. + +std::string trace_evaluate(const Position& pos) { + + Value margin; + std::string totals; + + TraceStream.str(""); + TraceStream << std::showpoint << std::showpos << std::fixed << std::setprecision(2); + memset(TracedTerms, 0, 2 * 16 * sizeof(Score)); + + do_evaluate(pos, margin); + + totals = TraceStream.str(); + TraceStream.str(""); + + TraceStream << std::setw(21) << "Eval term " << "| White | Black | Total \n" + << " | MG EG | MG EG | MG EG \n" + << "---------------------+-------------+-------------+---------------\n"; + + trace_row("Material, PST, Tempo", PST); + trace_row("Material imbalance", IMBALANCE); + trace_row("Pawns", PAWN); + trace_row("Knights", KNIGHT); + trace_row("Bishops", BISHOP); + trace_row("Rooks", ROOK); + trace_row("Queens", QUEEN); + trace_row("Mobility", MOBILITY); + trace_row("King safety", KING); + trace_row("Threats", THREAT); + trace_row("Passed pawns", PASSED); + trace_row("Unstoppable pawns", UNSTOPPABLE); + trace_row("Space", SPACE); + + TraceStream << "---------------------+-------------+-------------+---------------\n"; + trace_row("Total", TOTAL); + TraceStream << totals; + + return TraceStream.str(); }