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
5 Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
7 Stockfish is free software: you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation, either version 3 of the License, or
10 (at your option) any later version.
12 Stockfish is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program. If not, see <http://www.gnu.org/licenses/>.
32 #define S(mg, eg) make_score(mg, eg)
34 // Isolated pawn penalty by opposed flag
35 const Score Isolated[2] = { S(45, 40), S(30, 27) };
37 // Backward pawn penalty by opposed flag
38 const Score Backward[2] = { S(56, 33), S(41, 19) };
40 // Unsupported pawn penalty for pawns which are neither isolated or backward,
41 // by number of pawns it supports [less than 2 / exactly 2].
42 const Score Unsupported[2] = { S(17, 8), S(21, 12) };
44 // Connected pawn bonus by opposed, phalanx, twice supported and rank
45 Score Connected[2][2][2][RANK_NB];
47 // Doubled pawn penalty by file
48 const Score Doubled[FILE_NB] = {
49 S(11, 34), S(17, 38), S(19, 38), S(19, 38),
50 S(19, 38), S(19, 38), S(17, 38), S(11, 34) };
52 // Lever bonus by rank
53 const Score Lever[RANK_NB] = {
54 S( 0, 0), S( 0, 0), S(0, 0), S(0, 0),
55 S(17, 16), S(33, 32), S(0, 0), S(0, 0) };
57 // Weakness of our pawn shelter in front of the king by [distance from edge][rank]
58 const Value ShelterWeakness[][RANK_NB] = {
59 { V( 97), V(21), V(26), V(51), V(87), V( 89), V( 99) },
60 { V(120), V( 0), V(28), V(76), V(88), V(103), V(104) },
61 { V(101), V( 7), V(54), V(78), V(77), V( 92), V(101) },
62 { V( 80), V(11), V(44), V(68), V(87), V( 90), V(119) } };
64 // Danger of enemy pawns moving toward our king by [type][distance from edge][rank]
65 const Value StormDanger[][4][RANK_NB] = {
66 { { V( 0), V( 67), V( 134), V(38), V(32) },
67 { V( 0), V( 57), V( 139), V(37), V(22) },
68 { V( 0), V( 43), V( 115), V(43), V(27) },
69 { V( 0), V( 68), V( 124), V(57), V(32) } },
70 { { V(20), V( 43), V( 100), V(56), V(20) },
71 { V(23), V( 20), V( 98), V(40), V(15) },
72 { V(23), V( 39), V( 103), V(36), V(18) },
73 { V(28), V( 19), V( 108), V(42), V(26) } },
74 { { V( 0), V( 0), V( 75), V(14), V( 2) },
75 { V( 0), V( 0), V( 150), V(30), V( 4) },
76 { V( 0), V( 0), V( 160), V(22), V( 5) },
77 { V( 0), V( 0), V( 166), V(24), V(13) } },
78 { { V( 0), V(-283), V(-281), V(57), V(31) },
79 { V( 0), V( 58), V( 141), V(39), V(18) },
80 { V( 0), V( 65), V( 142), V(48), V(32) },
81 { V( 0), V( 60), V( 126), V(51), V(19) } } };
83 // Max bonus for king safety. Corresponds to start position with all the pawns
84 // in front of the king and no enemy pawn on the horizon.
85 const Value MaxSafetyBonus = V(258);
91 Score evaluate(const Position& pos, Pawns::Entry* e) {
93 const Color Them = (Us == WHITE ? BLACK : WHITE);
94 const Square Up = (Us == WHITE ? DELTA_N : DELTA_S);
95 const Square Right = (Us == WHITE ? DELTA_NE : DELTA_SW);
96 const Square Left = (Us == WHITE ? DELTA_NW : DELTA_SE);
98 Bitboard b, neighbours, stoppers, doubled, supported, phalanx;
100 bool opposed, lever, connected, backward;
101 Score score = SCORE_ZERO;
102 const Square* pl = pos.squares<PAWN>(Us);
103 const Bitboard* pawnAttacksBB = StepAttacksBB[make_piece(Us, PAWN)];
105 Bitboard ourPawns = pos.pieces(Us , PAWN);
106 Bitboard theirPawns = pos.pieces(Them, PAWN);
108 e->passedPawns[Us] = e->pawnAttacksSpan[Us] = 0;
109 e->kingSquares[Us] = SQ_NONE;
110 e->semiopenFiles[Us] = 0xFF;
111 e->pawnAttacks[Us] = shift_bb<Right>(ourPawns) | shift_bb<Left>(ourPawns);
112 e->pawnsOnSquares[Us][BLACK] = popcount(ourPawns & DarkSquares);
113 e->pawnsOnSquares[Us][WHITE] = pos.count<PAWN>(Us) - e->pawnsOnSquares[Us][BLACK];
115 // Loop through all pawns of the current color and score each pawn
116 while ((s = *pl++) != SQ_NONE)
118 assert(pos.piece_on(s) == make_piece(Us, PAWN));
122 e->semiopenFiles[Us] &= ~(1 << f);
123 e->pawnAttacksSpan[Us] |= pawn_attack_span(Us, s);
126 opposed = theirPawns & forward_bb(Us, s);
127 stoppers = theirPawns & passed_pawn_mask(Us, s);
128 lever = theirPawns & pawnAttacksBB[s];
129 doubled = ourPawns & forward_bb(Us, s);
130 neighbours = ourPawns & adjacent_files_bb(f);
131 phalanx = neighbours & rank_bb(s);
132 supported = neighbours & rank_bb(s - Up);
133 connected = supported | phalanx;
135 // A pawn is backward when it is behind all pawns of the same color on the
136 // adjacent files and cannot be safely advanced.
137 if (!neighbours || lever || relative_rank(Us, s) >= RANK_5)
141 // Find the backmost rank with neighbours or stoppers
142 b = rank_bb(backmost_sq(Us, neighbours | stoppers));
144 // The pawn is backward when it cannot safely progress to that rank:
145 // either there is a stopper in the way on this rank, or there is a
146 // stopper on adjacent file which controls the way to that rank.
147 backward = (b | shift_bb<Up>(b & adjacent_files_bb(f))) & stoppers;
149 assert(!backward || !(pawn_attack_span(Them, s + Up) & neighbours));
152 // Passed pawns will be properly scored in evaluation because we need
153 // full attack info to evaluate them. Only the frontmost passed
154 // pawn on each file is considered a true passed pawn.
155 if (!(stoppers | doubled))
156 e->passedPawns[Us] |= s;
160 score -= Isolated[opposed];
163 score -= Backward[opposed];
166 score -= Unsupported[more_than_one(neighbours & pawnAttacksBB[s])];
169 score += Connected[opposed][!!phalanx][more_than_one(supported)][relative_rank(Us, s)];
172 score -= Doubled[f] / distance<Rank>(s, frontmost_sq(Us, doubled));
175 score += Lever[relative_rank(Us, s)];
178 b = e->semiopenFiles[Us] ^ 0xFF;
179 e->pawnSpan[Us] = b ? int(msb(b) - lsb(b)) : 0;
188 /// Pawns::init() initializes some tables needed by evaluation. Instead of using
189 /// hard-coded tables, when makes sense, we prefer to calculate them with a formula
190 /// to reduce independent parameters and to allow easier tuning and better insight.
194 static const int Seed[RANK_NB] = { 0, 8, 19, 13, 71, 94, 169, 324 };
196 for (int opposed = 0; opposed <= 1; ++opposed)
197 for (int phalanx = 0; phalanx <= 1; ++phalanx)
198 for (int apex = 0; apex <= 1; ++apex)
199 for (Rank r = RANK_2; r < RANK_8; ++r)
201 int v = (Seed[r] + (phalanx ? (Seed[r + 1] - Seed[r]) / 2 : 0)) >> opposed;
202 v += (apex ? v / 2 : 0);
203 Connected[opposed][phalanx][apex][r] = make_score(v, v * 5 / 8);
208 /// Pawns::probe() looks up the current position's pawns configuration in
209 /// the pawns hash table. It returns a pointer to the Entry if the position
210 /// is found. Otherwise a new Entry is computed and stored there, so we don't
211 /// have to recompute all when the same pawns configuration occurs again.
213 Entry* probe(const Position& pos) {
215 Key key = pos.pawn_key();
216 Entry* e = pos.this_thread()->pawnsTable[key];
222 e->score = evaluate<WHITE>(pos, e) - evaluate<BLACK>(pos, e);
223 e->asymmetry = popcount(e->semiopenFiles[WHITE] ^ e->semiopenFiles[BLACK]);
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 enum { NoFriendlyPawn, Unblocked, BlockedByPawn, BlockedByKing };
238 Bitboard b = pos.pieces(PAWN) & (in_front_bb(Us, rank_of(ksq)) | rank_bb(ksq));
239 Bitboard ourPawns = b & pos.pieces(Us);
240 Bitboard theirPawns = b & pos.pieces(Them);
241 Value safety = MaxSafetyBonus;
242 File center = std::max(FILE_B, std::min(FILE_G, file_of(ksq)));
244 for (File f = center - File(1); f <= center + File(1); ++f)
246 b = ourPawns & file_bb(f);
247 Rank rkUs = b ? relative_rank(Us, backmost_sq(Us, b)) : RANK_1;
249 b = theirPawns & file_bb(f);
250 Rank rkThem = b ? relative_rank(Us, frontmost_sq(Them, b)) : RANK_1;
252 safety -= ShelterWeakness[std::min(f, FILE_H - f)][rkUs]
254 [f == file_of(ksq) && rkThem == relative_rank(Us, ksq) + 1 ? BlockedByKing :
255 rkUs == RANK_1 ? NoFriendlyPawn :
256 rkThem == rkUs + 1 ? BlockedByPawn : Unblocked]
257 [std::min(f, FILE_H - f)][rkThem];
264 /// Entry::do_king_safety() calculates a bonus for king safety. It is called only
265 /// when king square changes, which is about 20% of total king_safety() calls.
268 Score Entry::do_king_safety(const Position& pos, Square ksq) {
270 kingSquares[Us] = ksq;
271 castlingRights[Us] = pos.can_castle(Us);
272 int minKingPawnDistance = 0;
274 Bitboard pawns = pos.pieces(Us, PAWN);
276 while (!(DistanceRingBB[ksq][minKingPawnDistance++] & pawns)) {}
278 Value bonus = shelter_storm<Us>(pos, ksq);
280 // If we can castle use the bonus after the castling if it is bigger
281 if (pos.can_castle(MakeCastling<Us, KING_SIDE>::right))
282 bonus = std::max(bonus, shelter_storm<Us>(pos, relative_square(Us, SQ_G1)));
284 if (pos.can_castle(MakeCastling<Us, QUEEN_SIDE>::right))
285 bonus = std::max(bonus, shelter_storm<Us>(pos, relative_square(Us, SQ_C1)));
287 return make_score(bonus, -16 * minKingPawnDistance);
290 // Explicit template instantiation
291 template Score Entry::do_king_safety<WHITE>(const Position& pos, Square ksq);
292 template Score Entry::do_king_safety<BLACK>(const Position& pos, Square ksq);