Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
- Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
+ Copyright (C) 2015-2017 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
// by the evaluation functions.
struct EvalInfo {
+ Material::Entry* me;
+ Pawns::Entry* pe;
+ Bitboard pinnedPieces[COLOR_NB];
+ Bitboard mobilityArea[COLOR_NB];
+
// attackedBy[color][piece type] is a bitboard representing all squares
// attacked by a given color and piece type (can be also ALL_PIECES).
Bitboard attackedBy[COLOR_NB][PIECE_TYPE_NB];
// 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];
- Material::Entry* me;
- Pawns::Entry* pi;
};
#define V(v) Value(v)
#define S(mg, eg) make_score(mg, eg)
- // MobilityBonus[PieceType][attacked] contains bonuses for middle and end
- // game, indexed by piece type and number of attacked squares in the MobilityArea.
+ // MobilityBonus[PieceType][attacked] contains bonuses for middle and end game,
+ // indexed by piece type and number of attacked squares in the mobility area.
const Score MobilityBonus[][32] = {
{}, {},
{ S(-75,-76), S(-56,-54), S( -9,-26), S( -2,-10), S( 6, 5), S( 15, 11), // Knights
S(0, 0), S(0, 0), S(176, 139), S(131, 127), S(217, 218), S(203, 215)
};
- // Threat[by minor/by rook][attacked PieceType] contains
- // bonuses according to which piece type attacks which one.
- // Attacks on lesser pieces which are pawn-defended are not considered.
- const Score Threat[][PIECE_TYPE_NB] = {
- { S(0, 0), S(0, 33), S(45, 43), S(46, 47), S(72,107), S(48,118) }, // by Minor
- { S(0, 0), S(0, 25), S(40, 62), S(40, 59), S( 0, 34), S(35, 48) } // by Rook
+ // ThreatByMinor/ByRook[attacked PieceType] contains bonuses according to
+ // which piece type attacks which one. Attacks on lesser pieces which are
+ // pawn-defended are not considered.
+ const Score ThreatByMinor[PIECE_TYPE_NB] = {
+ S(0, 0), S(0, 33), S(45, 43), S(46, 47), S(72, 107), S(48, 118)
+ };
+
+ const Score ThreatByRook[PIECE_TYPE_NB] = {
+ S(0, 0), S(0, 25), S(40, 62), S(40, 59), S( 0, 34), S(35, 48)
};
- // ThreatByKing[on one/on many] contains bonuses for King attacks on
+ // ThreatByKing[on one/on many] contains bonuses for king attacks on
// pawns or pieces which are not pawn-defended.
const Score ThreatByKing[2] = { S(3, 62), S(9, 138) };
// PassedFile[File] contains a bonus according to the file of a passed pawn
const Score PassedFile[FILE_NB] = {
S( 9, 10), S( 2, 10), S( 1, -8), S(-20,-12),
- S(-20,-12), S( 1, -8), S( 2, 10), S( 9, 10)
+ S(-20,-12), S( 1, -8), S( 2, 10), S( 9, 10)
};
// Assorted bonuses and penalties used by evaluation
const Score BishopPawns = S( 8, 12);
const Score RookOnPawn = S( 8, 24);
const Score TrappedRook = S(92, 0);
- const Score CloseEnemies = S( 7, 0);
- const Score SafeCheck = S(20, 20);
+ const Score WeakQueen = S(50, 10);
const Score OtherCheck = S(10, 10);
- const Score ThreatByHangingPawn = S(71, 61);
+ const Score CloseEnemies = S( 7, 0);
+ const Score PawnlessFlank = S(20, 80);
const Score LooseEnemies = S( 0, 25);
- const Score WeakQueen = S(35, 0);
+ const Score ThreatByHangingPawn = S(71, 61);
+ const Score ThreatByRank = S(16, 3);
const Score Hanging = S(48, 27);
const Score ThreatByPawnPush = S(38, 22);
- const Score Unstoppable = S( 0, 20);
- const Score PawnlessFlank = S(20, 80);
const Score HinderPassedPawn = S( 7, 0);
// Penalty for a bishop on a1/h1 (a8/h8 for black) which is trapped by
// Penalties for enemy's safe checks
const int QueenContactCheck = 997;
- const int QueenCheck = 695;
- const int RookCheck = 638;
- const int BishopCheck = 538;
- const int KnightCheck = 874;
+ const int QueenCheck = 745;
+ const int RookCheck = 688;
+ const int BishopCheck = 588;
+ const int KnightCheck = 924;
+ // Threshold for lazy evaluation
+ const Value LazyEval = Value(1500);
// eval_init() initializes king and attack bitboards for a given color
// adding pawn attacks. To be done at the beginning of the evaluation.
void eval_init(const Position& pos, EvalInfo& ei) {
const Color Them = (Us == WHITE ? BLACK : WHITE);
+ const Square Up = (Us == WHITE ? NORTH : SOUTH);
const Square Down = (Us == WHITE ? SOUTH : NORTH);
+ const Bitboard LowRanks = (Us == WHITE ? Rank2BB | Rank3BB: Rank7BB | Rank6BB);
ei.pinnedPieces[Us] = pos.pinned_pieces(Us);
- Bitboard b = ei.attackedBy[Them][KING];
- ei.attackedBy[Them][ALL_PIECES] |= b;
- ei.attackedBy[Us][ALL_PIECES] |= ei.attackedBy[Us][PAWN] = ei.pi->pawn_attacks(Us);
- ei.attackedBy2[Us] = ei.attackedBy[Us][PAWN] & ei.attackedBy[Us][KING];
- // Init king safety tables only if we are going to use them
- if (pos.non_pawn_material(Us) >= QueenValueMg)
+ // Find our pawns on the first two ranks, and those which are blocked
+ Bitboard b = pos.pieces(Us, PAWN) & (shift<Down>(pos.pieces()) | LowRanks);
+
+ // Squares occupied by those pawns, by our king, or controlled by enemy pawns
+ // are excluded from the mobility area.
+ ei.mobilityArea[Us] = ~(b | pos.square<KING>(Us) | ei.pe->pawn_attacks(Them));
+
+ // Initialise the attack bitboards with the king and pawn information
+ b = ei.attackedBy[Us][KING] = pos.attacks_from<KING>(pos.square<KING>(Us));
+ ei.attackedBy[Us][PAWN] = ei.pe->pawn_attacks(Us);
+
+ ei.attackedBy2[Us] = b & ei.attackedBy[Us][PAWN];
+ ei.attackedBy[Us][ALL_PIECES] = b | ei.attackedBy[Us][PAWN];
+
+ // Init our king safety tables only if we are going to use them
+ if (pos.non_pawn_material(Them) >= QueenValueMg)
{
- ei.kingRing[Them] = b | shift<Down>(b);
- b &= ei.attackedBy[Us][PAWN];
- ei.kingAttackersCount[Us] = popcount(b);
- ei.kingAdjacentZoneAttacksCount[Us] = ei.kingAttackersWeight[Us] = 0;
+ ei.kingRing[Us] = b | shift<Up>(b);
+ ei.kingAttackersCount[Them] = popcount(b & ei.pe->pawn_attacks(Them));
+ ei.kingAdjacentZoneAttacksCount[Them] = ei.kingAttackersWeight[Them] = 0;
}
else
- ei.kingRing[Them] = ei.kingAttackersCount[Us] = 0;
+ ei.kingRing[Us] = ei.kingAttackersCount[Them] = 0;
}
// color and type.
template<bool DoTrace, Color Us = WHITE, PieceType Pt = KNIGHT>
- Score evaluate_pieces(const Position& pos, EvalInfo& ei, Score* mobility,
- const Bitboard* mobilityArea) {
- Bitboard b, bb;
- Square s;
- Score score = SCORE_ZERO;
+ Score evaluate_pieces(const Position& pos, EvalInfo& ei, Score* mobility) {
const PieceType NextPt = (Us == WHITE ? Pt : PieceType(Pt + 1));
const Color Them = (Us == WHITE ? BLACK : WHITE);
: Rank5BB | Rank4BB | Rank3BB);
const Square* pl = pos.squares<Pt>(Us);
+ Bitboard b, bb;
+ Square s;
+ Score score = SCORE_ZERO;
+
ei.attackedBy[Us][Pt] = 0;
while ((s = *pl++) != SQ_NONE)
| ei.attackedBy[Them][BISHOP]
| ei.attackedBy[Them][ROOK]);
- int mob = popcount(b & mobilityArea[Us]);
+ int mob = popcount(b & ei.mobilityArea[Us]);
mobility[Us] += MobilityBonus[Pt][mob];
if (Pt == BISHOP || Pt == KNIGHT)
{
// Bonus for outpost squares
- bb = OutpostRanks & ~ei.pi->pawn_attacks_span(Them);
+ bb = OutpostRanks & ~ei.pe->pawn_attacks_span(Them);
if (bb & s)
score += Outpost[Pt == BISHOP][!!(ei.attackedBy[Us][PAWN] & s)];
else
// Penalty for pawns on the same color square as the bishop
if (Pt == BISHOP)
- score -= BishopPawns * ei.pi->pawns_on_same_color_squares(Us, s);
+ score -= BishopPawns * ei.pe->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
score += RookOnPawn * popcount(pos.pieces(Them, PAWN) & PseudoAttacks[ROOK][s]);
// Bonus when on an open or semi-open file
- if (ei.pi->semiopen_file(Us, file_of(s)))
- score += RookOnFile[!!ei.pi->semiopen_file(Them, file_of(s))];
+ if (ei.pe->semiopen_file(Us, file_of(s)))
+ score += RookOnFile[!!ei.pe->semiopen_file(Them, file_of(s))];
- // Penalize when trapped by the king, even more if the king cannot castle
+ // Penalty when trapped by the king, even more if the king cannot castle
else if (mob <= 3)
{
Square ksq = pos.square<KING>(Us);
if ( ((file_of(ksq) < FILE_E) == (file_of(s) < file_of(ksq)))
- && (rank_of(ksq) == rank_of(s) || relative_rank(Us, ksq) == RANK_1)
- && !ei.pi->semiopen_side(Us, file_of(ksq), file_of(s) < file_of(ksq)))
+ && !ei.pe->semiopen_side(Us, file_of(ksq), file_of(s) < file_of(ksq)))
score -= (TrappedRook - make_score(mob * 22, 0)) * (1 + !pos.can_castle(Us));
}
}
Trace::add(Pt, Us, score);
// Recursively call evaluate_pieces() of next piece type until KING is excluded
- return score - evaluate_pieces<DoTrace, Them, NextPt>(pos, ei, mobility, mobilityArea);
+ return score - evaluate_pieces<DoTrace, Them, NextPt>(pos, ei, mobility);
}
template<>
- Score evaluate_pieces<false, WHITE, KING>(const Position&, EvalInfo&, Score*, const Bitboard*) { return SCORE_ZERO; }
+ Score evaluate_pieces<false, WHITE, KING>(const Position&, EvalInfo&, Score*) { return SCORE_ZERO; }
template<>
- Score evaluate_pieces< true, WHITE, KING>(const Position&, EvalInfo&, Score*, const Bitboard*) { return SCORE_ZERO; }
+ Score evaluate_pieces< true, WHITE, KING>(const Position&, EvalInfo&, Score*) { return SCORE_ZERO; }
// evaluate_king() assigns bonuses and penalties to a king of a given color
- const Bitboard WhiteCamp = Rank1BB | Rank2BB | Rank3BB | Rank4BB | Rank5BB;
- const Bitboard BlackCamp = Rank8BB | Rank7BB | Rank6BB | Rank5BB | Rank4BB;
- const Bitboard QueenSide = FileABB | FileBBB | FileCBB | FileDBB;
const Bitboard CenterFiles = FileCBB | FileDBB | FileEBB | FileFBB;
- const Bitboard KingSide = FileEBB | FileFBB | FileGBB | FileHBB;
- const Bitboard KingFlank[COLOR_NB][FILE_NB] = {
- { QueenSide & WhiteCamp, QueenSide & WhiteCamp, QueenSide & WhiteCamp, CenterFiles & WhiteCamp,
- CenterFiles & WhiteCamp, KingSide & WhiteCamp, KingSide & WhiteCamp, KingSide & WhiteCamp },
- { QueenSide & BlackCamp, QueenSide & BlackCamp, QueenSide & BlackCamp, CenterFiles & BlackCamp,
- CenterFiles & BlackCamp, KingSide & BlackCamp, KingSide & BlackCamp, KingSide & BlackCamp },
+ const Bitboard KingFlank[FILE_NB] = {
+ CenterFiles >> 2, CenterFiles >> 2, CenterFiles >> 2, CenterFiles, CenterFiles,
+ CenterFiles << 2, CenterFiles << 2, CenterFiles << 2
};
template<Color Us, bool DoTrace>
Score evaluate_king(const Position& pos, const EvalInfo& ei) {
- const Color Them = (Us == WHITE ? BLACK : WHITE);
- const Square Up = (Us == WHITE ? NORTH : SOUTH);
+ const Color Them = (Us == WHITE ? BLACK : WHITE);
+ const Square Up = (Us == WHITE ? NORTH : SOUTH);
+ const Bitboard Camp = (Us == WHITE ? ~Bitboard(0) ^ Rank6BB ^ Rank7BB ^ Rank8BB
+ : ~Bitboard(0) ^ Rank1BB ^ Rank2BB ^ Rank3BB);
+ const Square ksq = pos.square<KING>(Us);
Bitboard undefended, b, b1, b2, safe, other;
int kingDanger;
- const Square ksq = pos.square<KING>(Us);
// King shelter and enemy pawns storm
- Score score = ei.pi->king_safety<Us>(pos, ksq);
+ Score score = ei.pe->king_safety<Us>(pos, ksq);
// Main king safety evaluation
if (ei.kingAttackersCount[Them])
{
- // Find the attacked squares which are defended only by the king...
+ // Find the attacked squares which are defended only by our king...
undefended = ei.attackedBy[Them][ALL_PIECES]
& ei.attackedBy[Us][KING]
& ~ei.attackedBy2[Us];
- 7 * mg_value(score) / 5 - 5;
// Analyse the enemy's safe queen contact checks. Firstly, find the
- // undefended squares around the king reachable by the enemy queen...
+ // undefended squares around our king reachable by the enemy queen...
b = undefended & ei.attackedBy[Them][QUEEN] & ~pos.pieces(Them);
- // ...and keep squares supported by another enemy piece
+ // ...and keep squares supported by another enemy piece.
kingDanger += QueenContactCheck * popcount(b & ei.attackedBy2[Them]);
- // Analyse the safe enemy's checks which are possible on next move...
+ // Analyse the safe enemy's checks which are possible on next move
safe = ~(ei.attackedBy[Us][ALL_PIECES] | pos.pieces(Them));
- // ... and some other potential checks, only requiring the square to be
- // safe from pawn-attacks, and not being occupied by a blocked pawn.
- other = ~( ei.attackedBy[Us][PAWN]
- | (pos.pieces(Them, PAWN) & shift<Up>(pos.pieces(PAWN))));
-
b1 = pos.attacks_from<ROOK >(ksq);
b2 = pos.attacks_from<BISHOP>(ksq);
// Enemy queen safe checks
if ((b1 | b2) & ei.attackedBy[Them][QUEEN] & safe)
- kingDanger += QueenCheck, score -= SafeCheck;
+ kingDanger += QueenCheck;
- // For other pieces, also consider the square safe if attacked twice,
- // and only defended by a queen.
+ // For minors and rooks, also consider the square safe if attacked twice,
+ // and only defended by our queen.
safe |= ei.attackedBy2[Them]
& ~(ei.attackedBy2[Us] | pos.pieces(Them))
& ei.attackedBy[Us][QUEEN];
+ // Some other potential checks are also analysed, even from squares
+ // currently occupied by the opponent own pieces, as long as the square
+ // is not attacked by our pawns, and is not occupied by a blocked pawn.
+ other = ~( ei.attackedBy[Us][PAWN]
+ | (pos.pieces(Them, PAWN) & shift<Up>(pos.pieces(PAWN))));
+
// Enemy rooks safe and other checks
if (b1 & ei.attackedBy[Them][ROOK] & safe)
- kingDanger += RookCheck, score -= SafeCheck;
+ kingDanger += RookCheck;
else if (b1 & ei.attackedBy[Them][ROOK] & other)
score -= OtherCheck;
// Enemy bishops safe and other checks
if (b2 & ei.attackedBy[Them][BISHOP] & safe)
- kingDanger += BishopCheck, score -= SafeCheck;
+ kingDanger += BishopCheck;
else if (b2 & ei.attackedBy[Them][BISHOP] & other)
score -= OtherCheck;
// Enemy knights safe and other checks
b = pos.attacks_from<KNIGHT>(ksq) & ei.attackedBy[Them][KNIGHT];
if (b & safe)
- kingDanger += KnightCheck, score -= SafeCheck;
+ kingDanger += KnightCheck;
else if (b & other)
score -= OtherCheck;
- // Compute the king danger score and subtract it from the evaluation
+ // Transform the kingDanger units into a Score, and substract it from the evaluation
if (kingDanger > 0)
score -= make_score(std::min(kingDanger * kingDanger / 4096, 2 * int(BishopValueMg)), 0);
}
// King tropism: firstly, find squares that opponent attacks in our king flank
File kf = file_of(ksq);
- b = ei.attackedBy[Them][ALL_PIECES] & KingFlank[Us][kf];
+ b = ei.attackedBy[Them][ALL_PIECES] & KingFlank[kf] & Camp;
assert(((Us == WHITE ? b << 4 : b >> 4) & b) == 0);
assert(popcount(Us == WHITE ? b << 4 : b >> 4) == popcount(b));
score -= CloseEnemies * popcount(b);
// Penalty when our king is on a pawnless flank
- if (!(pos.pieces(PAWN) & (KingFlank[WHITE][kf] | KingFlank[BLACK][kf])))
+ if (!(pos.pieces(PAWN) & KingFlank[kf]))
score -= PawnlessFlank;
if (DoTrace)
const Bitboard TRank2BB = (Us == WHITE ? Rank2BB : Rank7BB);
const Bitboard TRank7BB = (Us == WHITE ? Rank7BB : Rank2BB);
- enum { Minor, Rook };
-
Bitboard b, weak, defended, safeThreats;
Score score = SCORE_ZERO;
{
b = (defended | weak) & (ei.attackedBy[Us][KNIGHT] | ei.attackedBy[Us][BISHOP]);
while (b)
- score += Threat[Minor][type_of(pos.piece_on(pop_lsb(&b)))];
+ {
+ Square s = pop_lsb(&b);
+ score += ThreatByMinor[type_of(pos.piece_on(s))];
+ if (type_of(pos.piece_on(s)) != PAWN)
+ score += ThreatByRank * (int)relative_rank(Them, s);
+ }
b = (pos.pieces(Them, QUEEN) | weak) & ei.attackedBy[Us][ROOK];
while (b)
- score += Threat[Rook ][type_of(pos.piece_on(pop_lsb(&b)))];
+ {
+ Square s = pop_lsb(&b);
+ score += ThreatByRook[type_of(pos.piece_on(s))];
+ if (type_of(pos.piece_on(s)) != PAWN)
+ score += ThreatByRank * (int)relative_rank(Them, s);
+ }
score += Hanging * popcount(weak & ~ei.attackedBy[Them][ALL_PIECES]);
Bitboard b, bb, squaresToQueen, defendedSquares, unsafeSquares;
Score score = SCORE_ZERO;
- b = ei.pi->passed_pawns(Us);
+ b = ei.pe->passed_pawns(Us);
while (b)
{
mbonus += rr + r * 2, ebonus += rr + r * 2;
} // rr != 0
+ // Assign a small bonus when the opponent has no pieces left
+ if (!pos.non_pawn_material(Them))
+ ebonus += 20;
+
score += make_score(mbonus, ebonus) + PassedFile[file_of(s)];
}
const Color Them = (Us == WHITE ? BLACK : WHITE);
const Bitboard SpaceMask =
- Us == WHITE ? (FileCBB | FileDBB | FileEBB | FileFBB) & (Rank2BB | Rank3BB | Rank4BB)
- : (FileCBB | FileDBB | FileEBB | FileFBB) & (Rank7BB | Rank6BB | Rank5BB);
+ Us == WHITE ? CenterFiles & (Rank2BB | Rank3BB | Rank4BB)
+ : CenterFiles & (Rank7BB | Rank6BB | Rank5BB);
// Find the safe squares for our pieces inside the area defined by
// SpaceMask. A square is unsafe if it is attacked by an enemy
// Since SpaceMask[Us] is fully on our half of the board...
assert(unsigned(safe >> (Us == WHITE ? 32 : 0)) == 0);
- // ...count safe + (behind & safe) with a single popcount
+ // ...count safe + (behind & safe) with a single popcount.
int bonus = popcount((Us == WHITE ? safe << 32 : safe >> 32) | (behind & safe));
bonus = std::min(16, bonus);
- int weight = pos.count<ALL_PIECES>(Us) - 2 * ei.pi->open_files();
+ int weight = pos.count<ALL_PIECES>(Us) - 2 * ei.pe->open_files();
return make_score(bonus * weight * weight / 18, 0);
}
return sf;
}
+
+ Value lazy_eval(Value mg, Value eg) {
+
+ if (mg > LazyEval && eg > LazyEval)
+ return LazyEval + ((mg + eg) / 2 - LazyEval) / 4;
+
+ else if (mg < -LazyEval && eg < -LazyEval)
+ return -LazyEval + ((mg + eg) / 2 + LazyEval) / 4;
+
+ return VALUE_ZERO;
+ }
+
} // namespace
Score score = pos.psq_score() + ei.me->imbalance();
// Probe the pawn hash table
- ei.pi = Pawns::probe(pos);
- score += ei.pi->pawns_score();
+ ei.pe = Pawns::probe(pos);
+ score += ei.pe->pawns_score();
+
+ // We have taken into account all cheap evaluation terms.
+ // If score exceeds a threshold return a lazy evaluation.
+ Value lazy = lazy_eval(mg_value(score), eg_value(score));
+ if (lazy)
+ return pos.side_to_move() == WHITE ? lazy : -lazy;
// Initialize attack and king safety bitboards
- ei.attackedBy[WHITE][ALL_PIECES] = ei.attackedBy[BLACK][ALL_PIECES] = 0;
- ei.attackedBy[WHITE][KING] = pos.attacks_from<KING>(pos.square<KING>(WHITE));
- ei.attackedBy[BLACK][KING] = pos.attacks_from<KING>(pos.square<KING>(BLACK));
eval_init<WHITE>(pos, ei);
eval_init<BLACK>(pos, ei);
- // Pawns blocked or on ranks 2 and 3 will be excluded from the mobility area
- Bitboard blockedPawns[] = {
- pos.pieces(WHITE, PAWN) & (shift<SOUTH>(pos.pieces()) | Rank2BB | Rank3BB),
- pos.pieces(BLACK, PAWN) & (shift<NORTH>(pos.pieces()) | Rank7BB | Rank6BB)
- };
-
- // Do not include in mobility area squares protected by enemy pawns, or occupied
- // by our blocked pawns or king.
- Bitboard mobilityArea[] = {
- ~(ei.attackedBy[BLACK][PAWN] | blockedPawns[WHITE] | pos.square<KING>(WHITE)),
- ~(ei.attackedBy[WHITE][PAWN] | blockedPawns[BLACK] | pos.square<KING>(BLACK))
- };
-
// Evaluate all pieces but king and pawns
- score += evaluate_pieces<DoTrace>(pos, ei, mobility, mobilityArea);
+ score += evaluate_pieces<DoTrace>(pos, ei, mobility);
score += mobility[WHITE] - mobility[BLACK];
// Evaluate kings after all other pieces because we need full attack
score += evaluate_passed_pawns<WHITE, DoTrace>(pos, ei)
- evaluate_passed_pawns<BLACK, DoTrace>(pos, ei);
- // If both sides have only pawns, score for potential unstoppable pawns
- if (!pos.non_pawn_material(WHITE) && !pos.non_pawn_material(BLACK))
- {
- Bitboard b;
- if ((b = ei.pi->passed_pawns(WHITE)) != 0)
- score += Unstoppable * int(relative_rank(WHITE, frontmost_sq(WHITE, b)));
-
- if ((b = ei.pi->passed_pawns(BLACK)) != 0)
- score -= Unstoppable * int(relative_rank(BLACK, frontmost_sq(BLACK, b)));
- }
-
// Evaluate space for both sides, only during opening
if (pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK) >= 12222)
score += evaluate_space<WHITE>(pos, ei)
- evaluate_space<BLACK>(pos, ei);
// Evaluate position potential for the winning side
- score += evaluate_initiative(pos, ei.pi->pawn_asymmetry(), eg_value(score));
+ score += evaluate_initiative(pos, ei.pe->pawn_asymmetry(), eg_value(score));
// Evaluate scale factor for the winning side
ScaleFactor sf = evaluate_scale_factor(pos, ei, eg_value(score));
{
Trace::add(MATERIAL, pos.psq_score());
Trace::add(IMBALANCE, ei.me->imbalance());
- Trace::add(PAWN, ei.pi->pawns_score());
+ Trace::add(PAWN, ei.pe->pawns_score());
Trace::add(MOBILITY, mobility[WHITE], mobility[BLACK]);
- Trace::add(SPACE, evaluate_space<WHITE>(pos, ei)
- , evaluate_space<BLACK>(pos, ei));
+ if (pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK) >= 12222)
+ Trace::add(SPACE, evaluate_space<WHITE>(pos, ei)
+ , evaluate_space<BLACK>(pos, ei));
Trace::add(TOTAL, score);
}