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-2013 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/>.
31 #define S(mg, eg) make_score(mg, eg)
33 // Doubled pawn penalty by opposed flag and file
34 const Score Doubled[2][FILE_NB] = {
35 { S(13, 43), S(20, 48), S(23, 48), S(23, 48),
36 S(23, 48), S(23, 48), S(20, 48), S(13, 43) },
37 { S(13, 43), S(20, 48), S(23, 48), S(23, 48),
38 S(23, 48), S(23, 48), S(20, 48), S(13, 43) }};
40 // Isolated pawn penalty by opposed flag and file
41 const Score Isolated[2][FILE_NB] = {
42 { S(37, 45), S(54, 52), S(60, 52), S(60, 52),
43 S(60, 52), S(60, 52), S(54, 52), S(37, 45) },
44 { S(25, 30), S(36, 35), S(40, 35), S(40, 35),
45 S(40, 35), S(40, 35), S(36, 35), S(25, 30) }};
47 // Backward pawn penalty by opposed flag and file
48 const Score Backward[2][FILE_NB] = {
49 { S(30, 42), S(43, 46), S(49, 46), S(49, 46),
50 S(49, 46), S(49, 46), S(43, 46), S(30, 42) },
51 { S(20, 28), S(29, 31), S(33, 31), S(33, 31),
52 S(33, 31), S(33, 31), S(29, 31), S(20, 28) }};
54 // Pawn chain membership bonus by file and rank (initialized by formula)
55 Score ChainMember[FILE_NB][RANK_NB];
57 // Candidate passed pawn bonus by rank
58 const Score CandidatePassed[RANK_NB] = {
59 S( 0, 0), S( 6, 13), S(6,13), S(14,29),
60 S(34,68), S(83,166), S(0, 0), S( 0, 0)
63 // Weakness of our pawn shelter in front of the king indexed by [rank]
64 const Value ShelterWeakness[RANK_NB] =
65 { V(100), V(0), V(27), V(73), V(92), V(101), V(101) };
67 // Danger of enemy pawns moving toward our king indexed by
68 // [no friendly pawn | pawn unblocked | pawn blocked][rank of enemy pawn]
69 const Value StormDanger[3][RANK_NB] = {
70 { V( 0), V(64), V(128), V(51), V(26) },
71 { V(26), V(32), V( 96), V(38), V(20) },
72 { V( 0), V( 0), V( 64), V(25), V(13) }};
74 // Max bonus for king safety. Corresponds to start position with all the pawns
75 // in front of the king and no enemy pawn on the horizont.
76 const Value MaxSafetyBonus = V(263);
82 Score evaluate(const Position& pos, Pawns::Entry* e) {
84 const Color Them = (Us == WHITE ? BLACK : WHITE);
85 const Square Up = (Us == WHITE ? DELTA_N : DELTA_S);
86 const Square Right = (Us == WHITE ? DELTA_NE : DELTA_SW);
87 const Square Left = (Us == WHITE ? DELTA_NW : DELTA_SE);
92 bool passed, isolated, doubled, opposed, chain, backward, candidate;
93 Score value = SCORE_ZERO;
94 const Square* pl = pos.list<PAWN>(Us);
96 Bitboard ourPawns = pos.pieces(Us, PAWN);
97 Bitboard theirPawns = pos.pieces(Them, PAWN);
99 e->passedPawns[Us] = e->candidatePawns[Us] = 0;
100 e->kingSquares[Us] = SQ_NONE;
101 e->semiopenFiles[Us] = 0xFF;
102 e->pawnAttacks[Us] = shift_bb<Right>(ourPawns) | shift_bb<Left>(ourPawns);
103 e->pawnsOnSquares[Us][BLACK] = popcount<Max15>(ourPawns & DarkSquares);
104 e->pawnsOnSquares[Us][WHITE] = pos.count<PAWN>(Us) - e->pawnsOnSquares[Us][BLACK];
106 // Loop through all pawns of the current color and score each pawn
107 while ((s = *pl++) != SQ_NONE)
109 assert(pos.piece_on(s) == make_piece(Us, PAWN));
113 // This file cannot be semi-open
114 e->semiopenFiles[Us] &= ~(1 << f);
116 // Our rank plus previous one. Used for chain detection
117 b = rank_bb(s) | rank_bb(s - pawn_push(Us));
119 // Flag the pawn as passed, isolated, doubled or member of a pawn
120 // chain (but not the backward one).
121 chain = ourPawns & adjacent_files_bb(f) & b;
122 isolated = !(ourPawns & adjacent_files_bb(f));
123 doubled = ourPawns & forward_bb(Us, s);
124 opposed = theirPawns & forward_bb(Us, s);
125 passed = !(theirPawns & passed_pawn_mask(Us, s));
127 // Test for backward pawn.
128 // If the pawn is passed, isolated, or member of a pawn chain it cannot
129 // be backward. If there are friendly pawns behind on adjacent files
130 // or if can capture an enemy pawn it cannot be backward either.
131 if ( (passed | isolated | chain)
132 || (ourPawns & pawn_attack_span(Them, s))
133 || (pos.attacks_from<PAWN>(s, Us) & theirPawns))
137 // We now know that there are no friendly pawns beside or behind this
138 // pawn on adjacent files. We now check whether the pawn is
139 // backward by looking in the forward direction on the adjacent
140 // files, and picking the closest pawn there.
141 b = pawn_attack_span(Us, s) & (ourPawns | theirPawns);
142 b = pawn_attack_span(Us, s) & rank_bb(backmost_sq(Us, b));
144 // If we have an enemy pawn in the same or next rank, the pawn is
145 // backward because it cannot advance without being captured.
146 backward = (b | shift_bb<Up>(b)) & theirPawns;
149 assert(opposed | passed | (pawn_attack_span(Us, s) & theirPawns));
151 // A not passed pawn is a candidate to become passed if it is free to
152 // advance and if the number of friendly pawns beside or behind this
153 // pawn on adjacent files is higher or equal than the number of
154 // enemy pawns in the forward direction on the adjacent files.
155 candidate = !(opposed | passed | backward | isolated)
156 && (b = pawn_attack_span(Them, s + pawn_push(Us)) & ourPawns) != 0
157 && popcount<Max15>(b) >= popcount<Max15>(pawn_attack_span(Us, s) & theirPawns);
159 // Passed pawns will be properly scored in evaluation because we need
160 // full attack info to evaluate passed pawns. Only the frontmost passed
161 // pawn on each file is considered a true passed pawn.
162 if (passed && !doubled)
163 e->passedPawns[Us] |= s;
167 value -= Isolated[opposed][f];
170 value -= Doubled[opposed][f];
173 value -= Backward[opposed][f];
176 value += ChainMember[f][relative_rank(Us, s)];
180 value += CandidatePassed[relative_rank(Us, s)];
183 e->candidatePawns[Us] |= s;
194 /// init() initializes some tables by formula instead of hard-code their values
198 const int chainByFile[8] = { 1, 3, 3, 4, 4, 3, 3, 1 };
201 for (Rank r = RANK_1; r < RANK_8; ++r)
202 for (File f = FILE_A; f <= FILE_H; ++f)
204 bonus = r * (r-1) * (r-2) + chainByFile[f] * (r/2 + 1);
205 ChainMember[f][r] = make_score(bonus, bonus);
210 /// probe() takes a position object as input, computes a Entry object, and returns
211 /// a pointer to it. The result is also stored in a hash table, so we don't have
212 /// to recompute everything when the same pawn structure occurs again.
214 Entry* probe(const Position& pos, Table& entries) {
216 Key key = pos.pawn_key();
217 Entry* e = entries[key];
223 e->value = evaluate<WHITE>(pos, e) - evaluate<BLACK>(pos, e);
228 /// Entry::shelter_storm() calculates shelter and storm penalties for the file
229 /// the king is on, as well as the two adjacent files.
232 Value Entry::shelter_storm(const Position& pos, Square ksq) {
234 const Color Them = (Us == WHITE ? BLACK : WHITE);
236 Value safety = MaxSafetyBonus;
237 Bitboard b = pos.pieces(PAWN) & (in_front_bb(Us, rank_of(ksq)) | rank_bb(ksq));
238 Bitboard ourPawns = b & pos.pieces(Us);
239 Bitboard theirPawns = b & pos.pieces(Them);
241 File kf = std::max(FILE_B, std::min(FILE_G, file_of(ksq)));
243 for (File f = kf - File(1); f <= kf + File(1); ++f)
245 b = ourPawns & file_bb(f);
246 rkUs = b ? relative_rank(Us, backmost_sq(Us, b)) : RANK_1;
247 safety -= ShelterWeakness[rkUs];
249 b = theirPawns & file_bb(f);
250 rkThem = b ? relative_rank(Us, frontmost_sq(Them, b)) : RANK_1;
251 safety -= StormDanger[rkUs == RANK_1 ? 0 : rkThem == rkUs + 1 ? 2 : 1][rkThem];
258 /// Entry::update_safety() calculates and caches a bonus for king safety. It is
259 /// called only when king square changes, about 20% of total king_safety() calls.
262 Score Entry::update_safety(const Position& pos, Square ksq) {
264 kingSquares[Us] = ksq;
265 castleRights[Us] = pos.can_castle(Us);
266 minKPdistance[Us] = 0;
268 Bitboard pawns = pos.pieces(Us, PAWN);
270 while (!(DistanceRingsBB[ksq][minKPdistance[Us]++] & pawns)) {}
272 if (relative_rank(Us, ksq) > RANK_4)
273 return kingSafety[Us] = make_score(0, -16 * minKPdistance[Us]);
275 Value bonus = shelter_storm<Us>(pos, ksq);
277 // If we can castle use the bonus after the castle if is bigger
278 if (pos.can_castle(make_castle_right(Us, KING_SIDE)))
279 bonus = std::max(bonus, shelter_storm<Us>(pos, relative_square(Us, SQ_G1)));
281 if (pos.can_castle(make_castle_right(Us, QUEEN_SIDE)))
282 bonus = std::max(bonus, shelter_storm<Us>(pos, relative_square(Us, SQ_C1)));
284 return kingSafety[Us] = make_score(bonus, -16 * minKPdistance[Us]);
287 // Explicit template instantiation
288 template Score Entry::update_safety<WHITE>(const Position& pos, Square ksq);
289 template Score Entry::update_safety<BLACK>(const Position& pos, Square ksq);