2 Stockfish, a UCI chess playing engine derived from Glaurung 2.1
3 Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
4 Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
6 Stockfish is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 Stockfish is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>.
32 #define S(mg, eg) make_score(mg, eg)
34 // Doubled pawn penalty by file
35 const Score Doubled[FILE_NB] = {
36 S(13, 43), S(20, 48), S(23, 48), S(23, 48),
37 S(23, 48), S(23, 48), S(20, 48), S(13, 43) };
39 // Isolated pawn penalty by opposed flag and file
40 const Score Isolated[2][FILE_NB] = {
41 { S(37, 45), S(54, 52), S(60, 52), S(60, 52),
42 S(60, 52), S(60, 52), S(54, 52), S(37, 45) },
43 { S(25, 30), S(36, 35), S(40, 35), S(40, 35),
44 S(40, 35), S(40, 35), S(36, 35), S(25, 30) } };
46 // Backward pawn penalty by opposed flag and file
47 const Score Backward[2][FILE_NB] = {
48 { S(30, 42), S(43, 46), S(49, 46), S(49, 46),
49 S(49, 46), S(49, 46), S(43, 46), S(30, 42) },
50 { S(20, 28), S(29, 31), S(33, 31), S(33, 31),
51 S(33, 31), S(33, 31), S(29, 31), S(20, 28) } };
53 // Connected pawn bonus by opposed, phalanx flags and rank
54 Score Connected[2][2][RANK_NB];
56 // Levers bonus by rank
57 const Score Lever[RANK_NB] = {
58 S( 0, 0), S( 0, 0), S(0, 0), S(0, 0),
59 S(20,20), S(40,40), S(0, 0), S(0, 0) };
61 // Unsupported pawn penalty
62 const Score UnsupportedPawnPenalty = S(20, 10);
64 // Weakness of our pawn shelter in front of the king by [distance from edge][rank]
65 const Value ShelterWeakness[][RANK_NB] = {
66 { V( 99), V(20), V(26), V(54), V(85), V( 92), V(108) },
67 { V(117), V( 1), V(27), V(71), V(94), V(104), V(118) },
68 { V(104), V( 4), V(51), V(76), V(82), V(102), V( 97) },
69 { V( 80), V(12), V(43), V(65), V(88), V( 91), V(115) } };
71 // Danger of enemy pawns moving toward our king by [type][distance from edge][rank]
72 const Value StormDanger[][4][RANK_NB] = {
73 { { V( 0), V( 65), V( 126), V(36), V(30) },
74 { V( 0), V( 55), V( 135), V(36), V(23) },
75 { V( 0), V( 47), V( 116), V(45), V(26) },
76 { V( 0), V( 62), V( 127), V(57), V(34) } },
77 { { V(21), V( 45), V( 93), V(50), V(19) },
78 { V(23), V( 24), V( 105), V(41), V(13) },
79 { V(23), V( 36), V( 101), V(38), V(20) },
80 { V(30), V( 19), V( 110), V(41), V(27) } },
81 { { V( 0), V( 0), V( 81), V(14), V( 4) },
82 { V( 0), V( 0), V( 169), V(30), V( 3) },
83 { V( 0), V( 0), V( 168), V(24), V( 5) },
84 { V( 0), V( 0), V( 162), V(26), V(10) } },
85 { { V( 0), V(-283), V(-298), V(57), V(29) },
86 { V( 0), V( 63), V( 137), V(42), V(18) },
87 { V( 0), V( 67), V( 145), V(49), V(33) },
88 { V( 0), V( 62), V( 126), V(53), V(21) } } };
90 // Max bonus for king safety. Corresponds to start position with all the pawns
91 // in front of the king and no enemy pawn on the horizon.
92 const Value MaxSafetyBonus = V(258);
98 Score evaluate(const Position& pos, Pawns::Entry* e) {
100 const Color Them = (Us == WHITE ? BLACK : WHITE);
101 const Square Up = (Us == WHITE ? DELTA_N : DELTA_S);
102 const Square Right = (Us == WHITE ? DELTA_NE : DELTA_SW);
103 const Square Left = (Us == WHITE ? DELTA_NW : DELTA_SE);
105 Bitboard b, p, doubled, connected;
107 bool passed, isolated, opposed, phalanx, backward, unsupported, lever;
108 Score score = SCORE_ZERO;
109 const Square* pl = pos.list<PAWN>(Us);
110 const Bitboard* pawnAttacksBB = StepAttacksBB[make_piece(Us, PAWN)];
112 Bitboard ourPawns = pos.pieces(Us , PAWN);
113 Bitboard theirPawns = pos.pieces(Them, PAWN);
115 e->passedPawns[Us] = 0;
116 e->kingSquares[Us] = SQ_NONE;
117 e->semiopenFiles[Us] = 0xFF;
118 e->pawnAttacks[Us] = shift_bb<Right>(ourPawns) | shift_bb<Left>(ourPawns);
119 e->pawnsOnSquares[Us][BLACK] = popcount<Max15>(ourPawns & DarkSquares);
120 e->pawnsOnSquares[Us][WHITE] = pos.count<PAWN>(Us) - e->pawnsOnSquares[Us][BLACK];
122 // Loop through all pawns of the current color and score each pawn
123 while ((s = *pl++) != SQ_NONE)
125 assert(pos.piece_on(s) == make_piece(Us, PAWN));
129 // This file cannot be semi-open
130 e->semiopenFiles[Us] &= ~(1 << f);
133 p = rank_bb(s - pawn_push(Us));
135 // Flag the pawn as passed, isolated, doubled,
136 // unsupported or connected (but not the backward one).
137 connected = ourPawns & adjacent_files_bb(f) & (rank_bb(s) | p);
138 phalanx = connected & rank_bb(s);
139 unsupported = !(ourPawns & adjacent_files_bb(f) & p);
140 isolated = !(ourPawns & adjacent_files_bb(f));
141 doubled = ourPawns & forward_bb(Us, s);
142 opposed = theirPawns & forward_bb(Us, s);
143 passed = !(theirPawns & passed_pawn_mask(Us, s));
144 lever = theirPawns & pawnAttacksBB[s];
146 // Test for backward pawn.
147 // If the pawn is passed, isolated, connected or a lever it cannot be
148 // backward. If there are friendly pawns behind on adjacent files
149 // it cannot be backward either.
150 if ( (passed | isolated | lever | connected)
151 || (ourPawns & pawn_attack_span(Them, s)))
155 // We now know that there are no friendly pawns beside or behind this
156 // pawn on adjacent files. We now check whether the pawn is
157 // backward by looking in the forward direction on the adjacent
158 // files, and picking the closest pawn there.
159 b = pawn_attack_span(Us, s) & (ourPawns | theirPawns);
160 b = pawn_attack_span(Us, s) & rank_bb(backmost_sq(Us, b));
162 // If we have an enemy pawn in the same or next rank, the pawn is
163 // backward because it cannot advance without being captured.
164 backward = (b | shift_bb<Up>(b)) & theirPawns;
167 assert(opposed | passed | (pawn_attack_span(Us, s) & theirPawns));
169 // Passed pawns will be properly scored in evaluation because we need
170 // full attack info to evaluate passed pawns. Only the frontmost passed
171 // pawn on each file is considered a true passed pawn.
172 if (passed && !doubled)
173 e->passedPawns[Us] |= s;
177 score -= Isolated[opposed][f];
179 if (unsupported && !isolated)
180 score -= UnsupportedPawnPenalty;
183 score -= Doubled[f] / distance<Rank>(s, frontmost_sq(Us, doubled));
186 score -= Backward[opposed][f];
189 score += Connected[opposed][phalanx][relative_rank(Us, s)];
192 score += Lever[relative_rank(Us, s)];
195 b = e->semiopenFiles[Us] ^ 0xFF;
196 e->pawnSpan[Us] = b ? int(msb(b) - lsb(b)) : 0;
205 /// Pawns::init() initializes some tables needed by evaluation. Instead of using
206 /// hard-coded tables, when makes sense, we prefer to calculate them with a formula
207 /// to reduce independent parameters and to allow easier tuning and better insight.
211 static const int Seed[RANK_NB] = { 0, 6, 15, 10, 57, 75, 135, 258 };
213 for (int opposed = 0; opposed <= 1; ++opposed)
214 for (int phalanx = 0; phalanx <= 1; ++phalanx)
215 for (Rank r = RANK_2; r < RANK_8; ++r)
217 int bonus = Seed[r] + (phalanx ? (Seed[r + 1] - Seed[r]) / 2 : 0);
218 Connected[opposed][phalanx][r] = make_score(bonus / 2, bonus >> opposed);
223 /// Pawns::probe() looks up the current position's pawns configuration in
224 /// the pawns hash table. It returns a pointer to the Entry if the position
225 /// is found. Otherwise a new Entry is computed and stored there, so we don't
226 /// have to recompute all when the same pawns configuration occurs again.
228 Entry* probe(const Position& pos) {
230 Key key = pos.pawn_key();
231 Entry* e = pos.this_thread()->pawnsTable[key];
237 e->score = evaluate<WHITE>(pos, e) - evaluate<BLACK>(pos, e);
242 /// Entry::shelter_storm() calculates shelter and storm penalties for the file
243 /// the king is on, as well as the two adjacent files.
246 Value Entry::shelter_storm(const Position& pos, Square ksq) {
248 const Color Them = (Us == WHITE ? BLACK : WHITE);
250 enum { NoFriendlyPawn, Unblocked, BlockedByPawn, BlockedByKing };
252 Bitboard b = pos.pieces(PAWN) & (in_front_bb(Us, rank_of(ksq)) | rank_bb(ksq));
253 Bitboard ourPawns = b & pos.pieces(Us);
254 Bitboard theirPawns = b & pos.pieces(Them);
255 Value safety = MaxSafetyBonus;
256 File center = std::max(FILE_B, std::min(FILE_G, file_of(ksq)));
258 for (File f = center - File(1); f <= center + File(1); ++f)
260 b = ourPawns & file_bb(f);
261 Rank rkUs = b ? relative_rank(Us, backmost_sq(Us, b)) : RANK_1;
263 b = theirPawns & file_bb(f);
264 Rank rkThem = b ? relative_rank(Us, frontmost_sq(Them, b)) : RANK_1;
266 safety -= ShelterWeakness[std::min(f, FILE_H - f)][rkUs]
268 [f == file_of(ksq) && rkThem == relative_rank(Us, ksq) + 1 ? BlockedByKing :
269 rkUs == RANK_1 ? NoFriendlyPawn :
270 rkThem == rkUs + 1 ? BlockedByPawn : Unblocked]
271 [std::min(f, FILE_H - f)][rkThem];
278 /// Entry::do_king_safety() calculates a bonus for king safety. It is called only
279 /// when king square changes, which is about 20% of total king_safety() calls.
282 Score Entry::do_king_safety(const Position& pos, Square ksq) {
284 kingSquares[Us] = ksq;
285 castlingRights[Us] = pos.can_castle(Us);
286 minKingPawnDistance[Us] = 0;
288 Bitboard pawns = pos.pieces(Us, PAWN);
290 while (!(DistanceRingBB[ksq][minKingPawnDistance[Us]++] & pawns)) {}
292 if (relative_rank(Us, ksq) > RANK_4)
293 return make_score(0, -16 * minKingPawnDistance[Us]);
295 Value bonus = shelter_storm<Us>(pos, ksq);
297 // If we can castle use the bonus after the castling if it is bigger
298 if (pos.can_castle(MakeCastling<Us, KING_SIDE>::right))
299 bonus = std::max(bonus, shelter_storm<Us>(pos, relative_square(Us, SQ_G1)));
301 if (pos.can_castle(MakeCastling<Us, QUEEN_SIDE>::right))
302 bonus = std::max(bonus, shelter_storm<Us>(pos, relative_square(Us, SQ_C1)));
304 return make_score(bonus, -16 * minKingPawnDistance[Us]);
307 // Explicit template instantiation
308 template Score Entry::do_king_safety<WHITE>(const Position& pos, Square ksq);
309 template Score Entry::do_king_safety<BLACK>(const Position& pos, Square ksq);