/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008 Marco Costalba
+ Copyright (C) 2008-2014 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
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
-
+
Stockfish is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
-
+
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
-
-////
-//// Includes
-////
-
+#include <algorithm>
#include <cassert>
-#include <cstring>
+#include "bitboard.h"
+#include "bitcount.h"
#include "pawns.h"
+#include "position.h"
+namespace {
-////
-//// Local definitions
-////
+ #define V Value
+ #define S(mg, eg) make_score(mg, eg)
+
+ // Doubled pawn penalty by file
+ const Score Doubled[FILE_NB] = {
+ S(13, 43), S(20, 48), S(23, 48), S(23, 48),
+ S(23, 48), S(23, 48), S(20, 48), S(13, 43) };
+
+ // Isolated pawn penalty by opposed flag and file
+ const Score Isolated[2][FILE_NB] = {
+ { S(37, 45), S(54, 52), S(60, 52), S(60, 52),
+ S(60, 52), S(60, 52), S(54, 52), S(37, 45) },
+ { S(25, 30), S(36, 35), S(40, 35), S(40, 35),
+ S(40, 35), S(40, 35), S(36, 35), S(25, 30) } };
+
+ // Backward pawn penalty by opposed flag and file
+ const Score Backward[2][FILE_NB] = {
+ { S(30, 42), S(43, 46), S(49, 46), S(49, 46),
+ S(49, 46), S(49, 46), S(43, 46), S(30, 42) },
+ { S(20, 28), S(29, 31), S(33, 31), S(33, 31),
+ S(33, 31), S(33, 31), S(29, 31), S(20, 28) } };
+
+ // Connected pawn bonus by opposed, phalanx flags and rank
+ Score Connected[2][2][RANK_NB];
+
+ // Levers bonus by rank
+ const Score Lever[RANK_NB] = {
+ S( 0, 0), S( 0, 0), S(0, 0), S(0, 0),
+ S(20,20), S(40,40), S(0, 0), S(0, 0) };
+
+ // Unsupported pawn penalty
+ const Score UnsupportedPawnPenalty = S(20, 10);
+
+ // Weakness of our pawn shelter in front of the king by [distance from edge][rank]
+ const Value ShelterWeakness[][RANK_NB] = {
+ { V(101), V(10), V(24), V(68), V(90), V( 95), V(102) },
+ { V(105), V( 1), V(30), V(76), V(95), V(100), V(105) },
+ { V( 99), V( 0), V(32), V(72), V(92), V(101), V(100) },
+ { V( 94), V( 1), V(31), V(68), V(89), V( 98), V(106) } };
+
+ // Danger of enemy pawns moving toward our king by [type][distance from edge][rank]
+ const Value StormDanger[][4][RANK_NB] = {
+ { { V( 0), V( 61), V( 128), V(47), V(27) },
+ { V( 0), V( 66), V( 131), V(49), V(27) },
+ { V( 0), V( 62), V( 126), V(52), V(23) },
+ { V( 0), V( 63), V( 128), V(52), V(26) } },
+ { { V(25), V( 33), V( 95), V(39), V(21) },
+ { V(24), V( 33), V( 97), V(42), V(22) },
+ { V(24), V( 33), V( 93), V(35), V(23) },
+ { V(26), V( 27), V( 96), V(37), V(22) } },
+ { { V( 0), V( 0), V( 80), V(14), V( 8) },
+ { V( 0), V( 0), V( 163), V(28), V(12) },
+ { V( 0), V( 0), V( 163), V(25), V(15) },
+ { V( 0), V( 0), V( 161), V(24), V(14) } },
+ { { V( 0), V(-300), V(-300), V(54), V(23) },
+ { V( 0), V( 67), V( 128), V(46), V(24) },
+ { V( 0), V( 64), V( 130), V(50), V(29) },
+ { V( 0), V( 63), V( 127), V(51), V(24) } } };
+
+ // Max bonus for king safety. Corresponds to start position with all the pawns
+ // in front of the king and no enemy pawn on the horizon.
+ const Value MaxSafetyBonus = V(261);
+
+ #undef S
+ #undef V
+
+ template<Color Us>
+ Score evaluate(const Position& pos, Pawns::Entry* e) {
+
+ const Color Them = (Us == WHITE ? BLACK : WHITE);
+ const Square Up = (Us == WHITE ? DELTA_N : DELTA_S);
+ const Square Right = (Us == WHITE ? DELTA_NE : DELTA_SW);
+ const Square Left = (Us == WHITE ? DELTA_NW : DELTA_SE);
+
+ Bitboard b, p, doubled, connected;
+ Square s;
+ bool passed, isolated, opposed, phalanx, backward, unsupported, lever;
+ Score value = SCORE_ZERO;
+ const Square* pl = pos.list<PAWN>(Us);
+ const Bitboard* pawnAttacksBB = StepAttacksBB[make_piece(Us, PAWN)];
+
+ Bitboard ourPawns = pos.pieces(Us , PAWN);
+ Bitboard theirPawns = pos.pieces(Them, PAWN);
+
+ e->passedPawns[Us] = 0;
+ e->kingSquares[Us] = SQ_NONE;
+ e->semiopenFiles[Us] = 0xFF;
+ e->pawnAttacks[Us] = shift_bb<Right>(ourPawns) | shift_bb<Left>(ourPawns);
+ e->pawnsOnSquares[Us][BLACK] = popcount<Max15>(ourPawns & DarkSquares);
+ e->pawnsOnSquares[Us][WHITE] = pos.count<PAWN>(Us) - e->pawnsOnSquares[Us][BLACK];
-namespace {
+ // Loop through all pawns of the current color and score each pawn
+ while ((s = *pl++) != SQ_NONE)
+ {
+ assert(pos.piece_on(s) == make_piece(Us, PAWN));
+
+ File f = file_of(s);
+
+ // This file cannot be semi-open
+ e->semiopenFiles[Us] &= ~(1 << f);
+
+ // Previous rank
+ p = rank_bb(s - pawn_push(Us));
+
+ // Flag the pawn as passed, isolated, doubled,
+ // unsupported or connected (but not the backward one).
+ connected = ourPawns & adjacent_files_bb(f) & (rank_bb(s) | p);
+ phalanx = connected & rank_bb(s);
+ unsupported = !(ourPawns & adjacent_files_bb(f) & p);
+ isolated = !(ourPawns & adjacent_files_bb(f));
+ doubled = ourPawns & forward_bb(Us, s);
+ opposed = theirPawns & forward_bb(Us, s);
+ passed = !(theirPawns & passed_pawn_mask(Us, s));
+ lever = theirPawns & pawnAttacksBB[s];
+
+ // Test for backward pawn.
+ // If the pawn is passed, isolated, or connected it cannot be
+ // backward. If there are friendly pawns behind on adjacent files
+ // or if it can capture an enemy pawn it cannot be backward either.
+ if ( (passed | isolated | connected)
+ || (ourPawns & pawn_attack_span(Them, s))
+ || (pos.attacks_from<PAWN>(s, Us) & theirPawns))
+ backward = false;
+ else
+ {
+ // We now know that there are no friendly pawns beside or behind this
+ // pawn on adjacent files. We now check whether the pawn is
+ // backward by looking in the forward direction on the adjacent
+ // files, and picking the closest pawn there.
+ b = pawn_attack_span(Us, s) & (ourPawns | theirPawns);
+ b = pawn_attack_span(Us, s) & rank_bb(backmost_sq(Us, b));
+
+ // If we have an enemy pawn in the same or next rank, the pawn is
+ // backward because it cannot advance without being captured.
+ backward = (b | shift_bb<Up>(b)) & theirPawns;
+ }
- /// Constants and variables
-
- // Doubled pawn penalty by file, middle game.
- const Value DoubledPawnMidgamePenalty[8] = {
- Value(20), Value(30), Value(34), Value(34),
- Value(34), Value(34), Value(30), Value(20)
- };
-
- // Doubled pawn penalty by file, endgame.
- const Value DoubledPawnEndgamePenalty[8] = {
- Value(35), Value(40), Value(40), Value(40),
- Value(40), Value(40), Value(40), Value(35)
- };
-
- // Isolated pawn penalty by file, middle game.
- const Value IsolatedPawnMidgamePenalty[8] = {
- Value(20), Value(30), Value(34), Value(34),
- Value(34), Value(34), Value(30), Value(20)
- };
-
- // Isolated pawn penalty by file, endgame.
- const Value IsolatedPawnEndgamePenalty[8] = {
- Value(35), Value(40), Value(40), Value(40),
- Value(40), Value(40), Value(40), Value(35)
- };
-
- // Backward pawn penalty by file, middle game.
- const Value BackwardPawnMidgamePenalty[8] = {
- Value(16), Value(24), Value(27), Value(27),
- Value(27), Value(27), Value(24), Value(16)
- };
-
- // Backward pawn penalty by file, endgame.
- const Value BackwardPawnEndgamePenalty[8] = {
- Value(28), Value(32), Value(32), Value(32),
- Value(32), Value(32), Value(32), Value(28)
- };
-
- // Pawn chain membership bonus by file, middle game.
- const Value ChainMidgameBonus[8] = {
- Value(14), Value(16), Value(17), Value(18),
- Value(18), Value(17), Value(16), Value(14)
- };
-
- // Pawn chain membership bonus by file, endgame.
- const Value ChainEndgameBonus[8] = {
- Value(16), Value(16), Value(16), Value(16),
- Value(16), Value(16), Value(16), Value(16)
- };
-
- // Candidate passed pawn bonus by rank, middle game.
- const Value CandidateMidgameBonus[8] = {
- Value( 0), Value(12), Value(12), Value(20),
- Value(40), Value(90), Value( 0), Value( 0)
- };
-
- // Candidate passed pawn bonus by rank, endgame.
- const Value CandidateEndgameBonus[8] = {
- Value( 0), Value(24), Value(24), Value(40),
- Value(80), Value(180), Value(0), Value( 0)
- };
-
- // Evaluate pawn storms?
- const bool EvaluatePawnStorms = true;
-
- // Pawn storm tables for positions with opposite castling:
- const int QStormTable[64] = {
- 0, 0, 0, 0, 0, 0, 0, 0,
- -22,-22,-22,-13,-4, 0, 0, 0,
- -4, -9, -9, -9,-4, 0, 0, 0,
- 9, 18, 22, 18, 9, 0, 0, 0,
- 22, 31, 31, 22, 0, 0, 0, 0,
- 31, 40, 40, 31, 0, 0, 0, 0,
- 31, 40, 40, 31, 0, 0, 0, 0,
- 0, 0, 0, 0, 0, 0, 0, 0
- };
-
- const int KStormTable[64] = {
- 0, 0, 0, 0, 0, 0, 0, 0,
- 0, 0, 0,-4,-13,-22,-27,-27,
- 0, 0, 0,-4, -9,-13,-18,-18,
- 0, 0, 0, 0, 9, 9, 9, 9,
- 0, 0, 0, 0, 9, 18, 27, 27,
- 0, 0, 0, 0, 9, 27, 40, 36,
- 0, 0, 0, 0, 0, 31, 40, 31,
- 0, 0, 0, 0, 0, 0, 0, 0
- };
-
- // Pawn storm open file bonuses by file:
- const int KStormOpenFileBonus[8] = {
- 45, 45, 30, 0, 0, 0, 0, 0
- };
-
- const int QStormOpenFileBonus[8] = {
- 0, 0, 0, 0, 0, 30, 45, 30
- };
+ assert(opposed | passed | (pawn_attack_span(Us, s) & theirPawns));
-}
+ // Passed pawns will be properly scored in evaluation because we need
+ // full attack info to evaluate passed pawns. Only the frontmost passed
+ // pawn on each file is considered a true passed pawn.
+ if (passed && !doubled)
+ e->passedPawns[Us] |= s;
+
+ // Score this pawn
+ if (isolated)
+ value -= Isolated[opposed][f];
+
+ if (unsupported && !isolated)
+ value -= UnsupportedPawnPenalty;
+
+ if (doubled)
+ value -= Doubled[f] / distance<Rank>(s, frontmost_sq(Us, doubled));
+ if (backward)
+ value -= Backward[opposed][f];
-////
-//// Functions
-////
+ if (connected)
+ value += Connected[opposed][phalanx][relative_rank(Us, s)];
-/// Constructor
+ if (lever)
+ value += Lever[relative_rank(Us, s)];
+ }
-PawnInfoTable::PawnInfoTable(unsigned numOfEntries) {
+ b = e->semiopenFiles[Us] ^ 0xFF;
+ e->pawnSpan[Us] = b ? int(msb(b) - lsb(b)) : 0;
- size = numOfEntries;
- entries = new PawnInfo[size];
- if (entries == NULL)
- {
- std::cerr << "Failed to allocate " << (numOfEntries * sizeof(PawnInfo))
- << " bytes for pawn hash table." << std::endl;
- exit(EXIT_FAILURE);
+ return value;
}
- clear();
-}
+} // namespace
-/// Destructor
+namespace Pawns {
-PawnInfoTable::~PawnInfoTable() {
- delete [] entries;
+/// init() initializes some tables used by evaluation. Instead of hard-coded
+/// tables, when makes sense, we prefer to calculate them with a formula to
+/// reduce independent parameters and to allow easier tuning and better insight.
+
+void init()
+{
+ static const int Seed[RANK_NB] = { 0, 6, 15, 10, 57, 75, 135, 258 };
+
+ for (int opposed = 0; opposed <= 1; ++opposed)
+ for (int phalanx = 0; phalanx <= 1; ++phalanx)
+ for (Rank r = RANK_2; r < RANK_8; ++r)
+ {
+ int bonus = Seed[r] + (phalanx ? (Seed[r + 1] - Seed[r]) / 2 : 0);
+ Connected[opposed][phalanx][r] = make_score(bonus / 2, bonus >> opposed);
+ }
}
-/// PawnInfoTable::clear() clears the pawn hash table by setting all
-/// entries to 0.
+/// probe() takes a position as input, computes a Entry object, and returns a
+/// pointer to it. The result is also stored in a hash table, so we don't have
+/// to recompute everything when the same pawn structure occurs again.
-void PawnInfoTable::clear() {
- memset(entries, 0, size * sizeof(PawnInfo));
-}
+Entry* probe(const Position& pos, Table& entries) {
+ Key key = pos.pawn_key();
+ Entry* e = entries[key];
-/// PawnInfoTable::get_pawn_info() takes a position object as input, computes
-/// a PawnInfo object, and returns a pointer to it. The result is also
-/// stored in a hash table, so we don't have to recompute everything when
-/// the same pawn structure occurs again.
+ if (e->key == key)
+ return e;
-PawnInfo *PawnInfoTable::get_pawn_info(const Position &pos) {
+ e->key = key;
+ e->value = evaluate<WHITE>(pos, e) - evaluate<BLACK>(pos, e);
+ return e;
+}
- assert(pos.is_ok());
- Key key = pos.get_pawn_key();
- int index = int(key & (size - 1));
- PawnInfo *pi = entries + index;
+/// Entry::shelter_storm() calculates shelter and storm penalties for the file
+/// the king is on, as well as the two adjacent files.
- // If pi->key matches the position's pawn hash key, it means that we
- // have analysed this pawn structure before, and we can simply return the
- // information we found the last time instead of recomputing it
- if (pi->key == key)
- return pi;
+template<Color Us>
+Value Entry::shelter_storm(const Position& pos, Square ksq) {
- // Clear the PawnInfo object, and set the key
- pi->clear();
- pi->key = key;
+ const Color Them = (Us == WHITE ? BLACK : WHITE);
- Value mgValue[2] = {Value(0), Value(0)};
- Value egValue[2] = {Value(0), Value(0)};
+ enum { NoFriendlyPawn, Unblocked, BlockedByPawn, BlockedByKing };
- // Loop through the pawns for both colors
- for (Color us = WHITE; us <= BLACK; us++)
+ Bitboard b = pos.pieces(PAWN) & (in_front_bb(Us, rank_of(ksq)) | rank_bb(ksq));
+ Bitboard ourPawns = b & pos.pieces(Us);
+ Bitboard theirPawns = b & pos.pieces(Them);
+ Value safety = MaxSafetyBonus;
+ File center = std::max(FILE_B, std::min(FILE_G, file_of(ksq)));
+
+ for (File f = center - File(1); f <= center + File(1); ++f)
{
- Color them = opposite_color(us);
- Bitboard ourPawns = pos.pawns(us);
- Bitboard theirPawns = pos.pawns(them);
- Bitboard pawns = ourPawns;
-
- // Initialize pawn storm scores by giving bonuses for open files
- if (EvaluatePawnStorms)
- for(File f = FILE_A; f <= FILE_H; f++)
- if(pos.file_is_half_open(us, f))
- {
- pi->ksStormValue[us] += KStormOpenFileBonus[f];
- pi->qsStormValue[us] += QStormOpenFileBonus[f];
- }
+ b = ourPawns & file_bb(f);
+ Rank rkUs = b ? relative_rank(Us, backmost_sq(Us, b)) : RANK_1;
+
+ b = theirPawns & file_bb(f);
+ Rank rkThem = b ? relative_rank(Us, frontmost_sq(Them, b)) : RANK_1;
+
+ safety -= ShelterWeakness[std::min(f, FILE_H - f)][rkUs]
+ + StormDanger
+ [f == file_of(ksq) && rkThem == relative_rank(Us, ksq) + 1 ? BlockedByKing :
+ rkUs == RANK_1 ? NoFriendlyPawn :
+ rkThem == rkUs + 1 ? BlockedByPawn : Unblocked]
+ [std::min(f, FILE_H - f)][rkThem];
+ }
- // Loop through all pawns of the current color and score each pawn
- while (pawns)
- {
- bool passed, doubled, isolated, backward, chain, candidate;
- Square s = pop_1st_bit(&pawns);
- File f = square_file(s);
- Rank r = square_rank(s);
+ return safety;
+}
- assert(pos.piece_on(s) == pawn_of_color(us));
- // The file containing the pawn is not half open
- pi->halfOpenFiles[us] &= ~(1 << f);
+/// Entry::do_king_safety() calculates a bonus for king safety. It is called only
+/// when king square changes, which is about 20% of total king_safety() calls.
- // Passed, isolated or doubled pawn?
- passed = pos.pawn_is_passed(us, s);
- isolated = pos.pawn_is_isolated(us, s);
- doubled = pos.pawn_is_doubled(us, s);
+template<Color Us>
+Score Entry::do_king_safety(const Position& pos, Square ksq) {
- if (EvaluatePawnStorms)
- {
- // We calculate kingside and queenside pawn storm scores
- // for both colors. These are used when evaluating middle
- // game positions with opposite side castling.
- //
- // Each pawn is given a base score given by a piece square table
- // (KStormTable[] or QStormTable[]). This score is increased if
- // there are enemy pawns on adjacent files in front of the pawn.
- // This is because we want to be able to open files against the
- // enemy king, and to avoid blocking the pawn structure (e.g. white
- // pawns on h6, g5, black pawns on h7, g6, f7).
-
- // Kingside and queenside pawn storms
- bool outPost = (outpost_mask(us, s) & theirPawns);
- bool passed = (passed_pawn_mask(us, s) & theirPawns);
- int KBonus = KStormTable[relative_square(us, s)];
- int QBonus = QStormTable[relative_square(us, s)];
-
- switch (f) {
-
- case FILE_A:
- QBonus += passed * QBonus / 4;
- break;
-
- case FILE_B:
- QBonus += passed * (QBonus / 2 + QBonus / 4);
- break;
-
- case FILE_C:
- QBonus += passed * QBonus / 2;
- break;
-
- case FILE_F:
- KBonus += outPost * KBonus / 4;
- break;
-
- case FILE_G:
- KBonus += outPost * (KBonus / 2 + KBonus / 4);
- break;
-
- case FILE_H:
- KBonus += outPost * KBonus / 2;
- break;
-
- default:
- break;
- }
- pi->ksStormValue[us] += KBonus;
- pi->qsStormValue[us] += QBonus;
- }
+ kingSquares[Us] = ksq;
+ castlingRights[Us] = pos.can_castle(Us);
+ minKingPawnDistance[Us] = 0;
- // Member of a pawn chain (but not the backward one)? We could speed up
- // the test a little by introducing an array of masks indexed by color
- // and square for doing the test, but because everything is hashed,
- // it probably won't make any noticable difference.
- chain = ourPawns
- & neighboring_files_bb(f)
- & (rank_bb(r) | rank_bb(r - (us == WHITE ? 1 : -1)));
-
- // Test for backward pawn
- //
- // If the pawn is passed, isolated, or member of a pawn chain
- // it cannot be backward. If can capture an enemy pawn or if
- // there are friendly pawns behind on neighboring files it cannot
- // be backward either.
- if ( passed
- || isolated
- || chain
- || (pos.pawn_attacks(us, s) & theirPawns)
- || (ourPawns & behind_bb(us, r) & neighboring_files_bb(f)))
- backward = false;
- else
- {
- // We now know that there are no friendly pawns beside or behind this
- // pawn on neighboring files. We now check whether the pawn is
- // backward by looking in the forward direction on the neighboring
- // files, and seeing whether we meet a friendly or an enemy pawn first.
- Bitboard b;
- if (us == WHITE)
- {
- for (b = pos.pawn_attacks(us, s); !(b & (ourPawns | theirPawns)); b <<= 8);
- backward = (b | (b << 8)) & theirPawns;
- }
- else
- {
- for (b = pos.pawn_attacks(us, s); !(b & (ourPawns | theirPawns)); b >>= 8);
- backward = (b | (b >> 8)) & theirPawns;
- }
- }
+ Bitboard pawns = pos.pieces(Us, PAWN);
+ if (pawns)
+ while (!(DistanceRingsBB[ksq][minKingPawnDistance[Us]++] & pawns)) {}
- // Test for candidate passed pawn
- candidate = !passed
- && pos.file_is_half_open(them, f)
- && ( count_1s_max_15(neighboring_files_bb(f) & (behind_bb(us, r) | rank_bb(r)) & ourPawns)
- - count_1s_max_15(neighboring_files_bb(f) & in_front_bb(us, r) & theirPawns)
- >= 0);
-
- // In order to prevent doubled passed pawns from receiving a too big
- // bonus, only the frontmost passed pawn on each file is considered as
- // a true passed pawn.
- if (passed && (ourPawns & squares_in_front_of(us, s)))
- {
- // candidate = true;
- passed = false;
- }
+ if (relative_rank(Us, ksq) > RANK_4)
+ return make_score(0, -16 * minKingPawnDistance[Us]);
- // Score this pawn
- Value mv = Value(0), ev = Value(0);
- if (isolated)
- {
- mv -= IsolatedPawnMidgamePenalty[f];
- ev -= IsolatedPawnEndgamePenalty[f];
- if (pos.file_is_half_open(them, f))
- {
- mv -= IsolatedPawnMidgamePenalty[f] / 2;
- ev -= IsolatedPawnEndgamePenalty[f] / 2;
- }
- }
- if (doubled)
- {
- mv -= DoubledPawnMidgamePenalty[f];
- ev -= DoubledPawnEndgamePenalty[f];
- }
- if (backward)
- {
- mv -= BackwardPawnMidgamePenalty[f];
- ev -= BackwardPawnEndgamePenalty[f];
- if (pos.file_is_half_open(them, f))
- {
- mv -= BackwardPawnMidgamePenalty[f] / 2;
- ev -= BackwardPawnEndgamePenalty[f] / 2;
- }
- }
- if (chain)
- {
- mv += ChainMidgameBonus[f];
- ev += ChainEndgameBonus[f];
- }
- if (candidate)
- {
- mv += CandidateMidgameBonus[relative_rank(us, s)];
- ev += CandidateEndgameBonus[relative_rank(us, s)];
- }
+ Value bonus = shelter_storm<Us>(pos, ksq);
+
+ // If we can castle use the bonus after the castling if it is bigger
+ if (pos.can_castle(MakeCastling<Us, KING_SIDE>::right))
+ bonus = std::max(bonus, shelter_storm<Us>(pos, relative_square(Us, SQ_G1)));
- mgValue[us] += mv;
- egValue[us] += ev;
-
- // If the pawn is passed, set the square of the pawn in the passedPawns
- // bitboard
- if (passed)
- set_bit(&(pi->passedPawns), s);
- } // while(pawns)
- } // for(colors)
-
- pi->mgValue = int16_t(mgValue[WHITE] - mgValue[BLACK]);
- pi->egValue = int16_t(egValue[WHITE] - egValue[BLACK]);
- return pi;
+ if (pos.can_castle(MakeCastling<Us, QUEEN_SIDE>::right))
+ bonus = std::max(bonus, shelter_storm<Us>(pos, relative_square(Us, SQ_C1)));
+
+ return make_score(bonus, -16 * minKingPawnDistance[Us]);
}
+
+// Explicit template instantiation
+template Score Entry::do_king_safety<WHITE>(const Position& pos, Square ksq);
+template Score Entry::do_king_safety<BLACK>(const Position& pos, Square ksq);
+
+} // namespace Pawns
projects / stockfish / blobdiff