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
55 const Score ChainMember[FILE_NB] = {
56 S(11,-1), S(13,-1), S(13,-1), S(14,-1),
57 S(14,-1), S(13,-1), S(13,-1), S(11,-1)
60 // Candidate passed pawn bonus by rank
61 const Score CandidatePassed[RANK_NB] = {
62 S( 0, 0), S( 6, 13), S(6,13), S(14,29),
63 S(34,68), S(83,166), S(0, 0), S( 0, 0)
66 // Weakness of our pawn shelter in front of the king indexed by [king pawn][rank]
67 const Value ShelterWeakness[2][RANK_NB] =
68 { { V(141), V(0), V(38), V(102), V(128), V(141), V(141) },
69 { V( 61), V(0), V(16), V( 44), V( 56), V( 61), V( 61) } };
71 // Danger of enemy pawns moving toward our king indexed by [pawn blocked][rank]
72 const Value StormDanger[2][RANK_NB] =
73 { { V(26), V(0), V(128), V(51), V(26) },
74 { V(13), V(0), V( 64), V(25), V(13) } };
76 // Max bonus for king safety. Corresponds to start position with all the pawns
77 // in front of the king and no enemy pawn on the horizont.
78 const Value MaxSafetyBonus = V(263);
84 Score evaluate(const Position& pos, Pawns::Entry* e) {
86 const Color Them = (Us == WHITE ? BLACK : WHITE);
87 const Square Up = (Us == WHITE ? DELTA_N : DELTA_S);
88 const Square Right = (Us == WHITE ? DELTA_NE : DELTA_SW);
89 const Square Left = (Us == WHITE ? DELTA_NW : DELTA_SE);
95 bool passed, isolated, doubled, opposed, chain, backward, candidate;
96 Score value = SCORE_ZERO;
97 const Square* pl = pos.list<PAWN>(Us);
99 Bitboard ourPawns = pos.pieces(Us, PAWN);
100 Bitboard theirPawns = pos.pieces(Them, PAWN);
102 e->passedPawns[Us] = 0;
103 e->kingSquares[Us] = SQ_NONE;
104 e->semiopenFiles[Us] = 0xFF;
105 e->pawnAttacks[Us] = shift_bb<Right>(ourPawns) | shift_bb<Left>(ourPawns);
106 e->pawnsOnSquares[Us][BLACK] = popcount<Max15>(ourPawns & BlackSquares);
107 e->pawnsOnSquares[Us][WHITE] = pos.count<PAWN>(Us) - e->pawnsOnSquares[Us][BLACK];
109 // Loop through all pawns of the current color and score each pawn
110 while ((s = *pl++) != SQ_NONE)
112 assert(pos.piece_on(s) == make_piece(Us, PAWN));
117 // This file cannot be semi-open
118 e->semiopenFiles[Us] &= ~(1 << f);
120 // Our rank plus previous one. Used for chain detection
121 b = rank_bb(r) | rank_bb(Us == WHITE ? r - Rank(1) : r + Rank(1));
123 // Flag the pawn as passed, isolated, doubled or member of a pawn
124 // chain (but not the backward one).
125 chain = ourPawns & adjacent_files_bb(f) & b;
126 isolated = !(ourPawns & adjacent_files_bb(f));
127 doubled = ourPawns & forward_bb(Us, s);
128 opposed = theirPawns & forward_bb(Us, s);
129 passed = !(theirPawns & passed_pawn_mask(Us, s));
131 // Test for backward pawn
134 // If the pawn is passed, isolated, or member of a pawn chain it cannot
135 // be backward. If there are friendly pawns behind on adjacent files
136 // or if can capture an enemy pawn it cannot be backward either.
137 if ( !(passed | isolated | chain)
138 && !(ourPawns & pawn_attack_span(Them, s))
139 && !(pos.attacks_from<PAWN>(s, Us) & theirPawns))
141 // We now know that there are no friendly pawns beside or behind this
142 // pawn on adjacent files. We now check whether the pawn is
143 // backward by looking in the forward direction on the adjacent
144 // files, and seeing whether we meet a friendly or an enemy pawn first.
145 b = pos.attacks_from<PAWN>(s, Us);
147 // Note that we are sure to find something because pawn is not passed
148 // nor isolated, so loop is potentially infinite, but it isn't.
149 while (!(b & (ourPawns | theirPawns)))
152 // The friendly pawn needs to be at least two ranks closer than the
153 // enemy pawn in order to help the potentially backward pawn advance.
154 backward = (b | shift_bb<Up>(b)) & theirPawns;
157 assert(opposed | passed | (pawn_attack_span(Us, s) & theirPawns));
159 // A not passed pawn is a candidate to become passed if it is free to
160 // advance and if the number of friendly pawns beside or behind this
161 // pawn on adjacent files is higher or equal than the number of
162 // enemy pawns in the forward direction on the adjacent files.
163 candidate = !(opposed | passed | backward | isolated)
164 && (b = pawn_attack_span(Them, s + pawn_push(Us)) & ourPawns) != 0
165 && popcount<Max15>(b) >= popcount<Max15>(pawn_attack_span(Us, s) & theirPawns);
167 // Passed pawns will be properly scored in evaluation because we need
168 // full attack info to evaluate passed pawns. Only the frontmost passed
169 // pawn on each file is considered a true passed pawn.
170 if (passed && !doubled)
171 e->passedPawns[Us] |= s;
175 value -= Isolated[opposed][f];
178 value -= Doubled[opposed][f];
181 value -= Backward[opposed][f];
184 value += ChainMember[f];
187 value += CandidatePassed[relative_rank(Us, s)];
197 /// probe() takes a position object as input, computes a Entry object, and returns
198 /// a pointer to it. The result is also stored in a hash table, so we don't have
199 /// to recompute everything when the same pawn structure occurs again.
201 Entry* probe(const Position& pos, Table& entries) {
203 Key key = pos.pawn_key();
204 Entry* e = entries[key];
210 e->value = evaluate<WHITE>(pos, e) - evaluate<BLACK>(pos, e);
215 /// Entry::shelter_storm() calculates shelter and storm penalties for the file
216 /// the king is on, as well as the two adjacent files.
219 Value Entry::shelter_storm(const Position& pos, Square ksq) {
221 const Color Them = (Us == WHITE ? BLACK : WHITE);
223 Value safety = MaxSafetyBonus;
224 Bitboard b = pos.pieces(PAWN) & (in_front_bb(Us, rank_of(ksq)) | rank_bb(ksq));
225 Bitboard ourPawns = b & pos.pieces(Us) & ~rank_bb(ksq);
226 Bitboard theirPawns = b & pos.pieces(Them);
228 File kf = file_of(ksq);
230 kf = (kf == FILE_A) ? FILE_B : (kf == FILE_H) ? FILE_G : kf;
232 for (int f = kf - 1; f <= kf + 1; f++)
234 // Shelter penalty is higher for the pawn in front of the king
235 b = ourPawns & FileBB[f];
236 rkUs = b ? rank_of(Us == WHITE ? lsb(b) : ~msb(b)) : RANK_1;
237 safety -= ShelterWeakness[f != kf][rkUs];
239 // Storm danger is smaller if enemy pawn is blocked
240 b = theirPawns & FileBB[f];
241 rkThem = b ? rank_of(Us == WHITE ? lsb(b) : ~msb(b)) : RANK_1;
242 safety -= StormDanger[rkThem == rkUs + 1][rkThem];
249 /// Entry::update_safety() calculates and caches a bonus for king safety. It is
250 /// called only when king square changes, about 20% of total king_safety() calls.
253 Score Entry::update_safety(const Position& pos, Square ksq) {
255 kingSquares[Us] = ksq;
256 castleRights[Us] = pos.can_castle(Us);
257 minKPdistance[Us] = 0;
259 Bitboard pawns = pos.pieces(Us, PAWN);
261 while (!(DistanceRingsBB[ksq][minKPdistance[Us]++] & pawns)) {}
263 if (relative_rank(Us, ksq) > RANK_4)
264 return kingSafety[Us] = make_score(0, -16 * minKPdistance[Us]);
266 Value bonus = shelter_storm<Us>(pos, ksq);
268 // If we can castle use the bonus after the castle if is bigger
269 if (pos.can_castle(make_castle_right(Us, KING_SIDE)))
270 bonus = std::max(bonus, shelter_storm<Us>(pos, relative_square(Us, SQ_G1)));
272 if (pos.can_castle(make_castle_right(Us, QUEEN_SIDE)))
273 bonus = std::max(bonus, shelter_storm<Us>(pos, relative_square(Us, SQ_C1)));
275 return kingSafety[Us] = make_score(bonus, -16 * minKPdistance[Us]);
278 // Explicit template instantiation
279 template Score Entry::update_safety<WHITE>(const Position& pos, Square ksq);
280 template Score Entry::update_safety<BLACK>(const Position& pos, Square ksq);