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-2019 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)
35 constexpr Score Backward = S( 9, 24);
36 constexpr Score Doubled = S(11, 56);
37 constexpr Score Isolated = S( 5, 15);
38 constexpr Score WeakUnopposed = S( 13, 27);
40 // Connected pawn bonus
41 constexpr int Connected[RANK_NB] = { 0, 7, 8, 12, 29, 48, 86 };
43 // Strength of pawn shelter for our king by [distance from edge][rank].
44 // RANK_1 = 0 is used for files where we have no pawn, or pawn is behind our king.
45 constexpr Value ShelterStrength[int(FILE_NB) / 2][RANK_NB] = {
46 { V( -6), V( 81), V( 93), V( 58), V( 39), V( 18), V( 25) },
47 { V(-43), V( 61), V( 35), V(-49), V(-29), V(-11), V( -63) },
48 { V(-10), V( 75), V( 23), V( -2), V( 32), V( 3), V( -45) },
49 { V(-39), V(-13), V(-29), V(-52), V(-48), V(-67), V(-166) }
52 // Danger of enemy pawns moving toward our king by [distance from edge][rank].
53 // RANK_1 = 0 is used for files where the enemy has no pawn, or their pawn
54 // is behind our king.
55 constexpr Value UnblockedStorm[int(FILE_NB) / 2][RANK_NB] = {
56 { V( 89), V(107), V(123), V(93), V(57), V( 45), V( 51) },
57 { V( 44), V(-18), V(123), V(46), V(39), V( -7), V( 23) },
58 { V( 4), V( 52), V(162), V(37), V( 7), V(-14), V( -2) },
59 { V(-10), V(-14), V( 90), V(15), V( 2), V( -7), V(-16) }
66 Score evaluate(const Position& pos, Pawns::Entry* e) {
68 constexpr Color Them = (Us == WHITE ? BLACK : WHITE);
69 constexpr Direction Up = (Us == WHITE ? NORTH : SOUTH);
71 Bitboard b, neighbours, stoppers, doubled, support, phalanx;
72 Bitboard lever, leverPush;
74 bool opposed, backward;
75 Score score = SCORE_ZERO;
76 const Square* pl = pos.squares<PAWN>(Us);
78 Bitboard ourPawns = pos.pieces( Us, PAWN);
79 Bitboard theirPawns = pos.pieces(Them, PAWN);
81 e->passedPawns[Us] = e->pawnAttacksSpan[Us] = 0;
82 e->kingSquares[Us] = SQ_NONE;
83 e->pawnAttacks[Us] = pawn_attacks_bb<Us>(ourPawns);
85 // Loop through all pawns of the current color and score each pawn
86 while ((s = *pl++) != SQ_NONE)
88 assert(pos.piece_on(s) == make_piece(Us, PAWN));
90 Rank r = relative_rank(Us, s);
92 e->pawnAttacksSpan[Us] |= pawn_attack_span(Us, s);
95 opposed = theirPawns & forward_file_bb(Us, s);
96 stoppers = theirPawns & passed_pawn_span(Us, s);
97 lever = theirPawns & PawnAttacks[Us][s];
98 leverPush = theirPawns & PawnAttacks[Us][s + Up];
99 doubled = ourPawns & (s - Up);
100 neighbours = ourPawns & adjacent_files_bb(s);
101 phalanx = neighbours & rank_bb(s);
102 support = neighbours & rank_bb(s - Up);
104 // A pawn is backward when it is behind all pawns of the same color
105 // on the adjacent files and cannot be safely advanced.
106 backward = !(ourPawns & pawn_attack_span(Them, s + Up))
107 && (stoppers & (leverPush | (s + Up)));
109 // Passed pawns will be properly scored in evaluation because we need
110 // full attack info to evaluate them. Include also not passed pawns
111 // which could become passed after one or two pawn pushes when are
112 // not attacked more times than defended.
113 if ( !(stoppers ^ lever) ||
114 (!(stoppers ^ leverPush) && popcount(phalanx) >= popcount(leverPush)))
115 e->passedPawns[Us] |= s;
117 else if (stoppers == square_bb(s + Up) && r >= RANK_5)
119 b = shift<Up>(support) & ~theirPawns;
121 if (!more_than_one(theirPawns & PawnAttacks[Us][pop_lsb(&b)]))
122 e->passedPawns[Us] |= s;
126 if (support | phalanx)
128 int v = Connected[r] * (phalanx ? 3 : 2) / (opposed ? 2 : 1)
129 + 17 * popcount(support);
131 score += make_score(v, v * (r - 2) / 4);
133 else if (!neighbours)
134 score -= Isolated + WeakUnopposed * int(!opposed);
137 score -= Backward + WeakUnopposed * int(!opposed);
139 if (doubled && !support)
150 /// Pawns::probe() looks up the current position's pawns configuration in
151 /// the pawns hash table. It returns a pointer to the Entry if the position
152 /// is found. Otherwise a new Entry is computed and stored there, so we don't
153 /// have to recompute all when the same pawns configuration occurs again.
155 Entry* probe(const Position& pos) {
157 Key key = pos.pawn_key();
158 Entry* e = pos.this_thread()->pawnsTable[key];
164 e->scores[WHITE] = evaluate<WHITE>(pos, e);
165 e->scores[BLACK] = evaluate<BLACK>(pos, e);
171 /// Entry::evaluate_shelter() calculates the shelter bonus and the storm
172 /// penalty for a king, looking at the king file and the two closest files.
175 void Entry::evaluate_shelter(const Position& pos, Square ksq, Score& shelter) {
177 constexpr Color Them = (Us == WHITE ? BLACK : WHITE);
178 constexpr Direction Down = (Us == WHITE ? SOUTH : NORTH);
179 constexpr Bitboard BlockSquares = (Rank1BB | Rank2BB | Rank7BB | Rank8BB)
180 & (FileABB | FileHBB);
182 Bitboard b = pos.pieces(PAWN) & ~forward_ranks_bb(Them, ksq);
183 Bitboard ourPawns = b & pos.pieces(Us);
184 Bitboard theirPawns = b & pos.pieces(Them);
186 Value bonus[] = { (shift<Down>(theirPawns) & BlockSquares & ksq) ? Value(374) : Value(5),
189 File center = clamp(file_of(ksq), FILE_B, FILE_G);
190 for (File f = File(center - 1); f <= File(center + 1); ++f)
192 b = ourPawns & file_bb(f);
193 Rank ourRank = b ? relative_rank(Us, frontmost_sq(Them, b)) : RANK_1;
195 b = theirPawns & file_bb(f);
196 Rank theirRank = b ? relative_rank(Us, frontmost_sq(Them, b)) : RANK_1;
198 int d = std::min(f, ~f);
199 bonus[MG] += ShelterStrength[d][ourRank];
201 if (ourRank && (ourRank == theirRank - 1))
202 bonus[MG] -= 82 * (theirRank == RANK_3), bonus[EG] -= 82 * (theirRank == RANK_3);
204 bonus[MG] -= UnblockedStorm[d][theirRank];
207 if (bonus[MG] > mg_value(shelter))
208 shelter = make_score(bonus[MG], bonus[EG]);
212 /// Entry::do_king_safety() calculates a bonus for king safety. It is called only
213 /// when king square changes, which is about 20% of total king_safety() calls.
216 Score Entry::do_king_safety(const Position& pos) {
218 Square ksq = pos.square<KING>(Us);
219 kingSquares[Us] = ksq;
220 castlingRights[Us] = pos.castling_rights(Us);
222 Bitboard pawns = pos.pieces(Us, PAWN);
223 int minPawnDist = pawns ? 8 : 0;
225 if (pawns & PseudoAttacks[KING][ksq])
229 minPawnDist = std::min(minPawnDist, distance(ksq, pop_lsb(&pawns)));
231 Score shelter = make_score(-VALUE_INFINITE, VALUE_ZERO);
232 evaluate_shelter<Us>(pos, ksq, shelter);
234 // If we can castle use the bonus after the castling if it is bigger
235 if (pos.can_castle(Us | KING_SIDE))
236 evaluate_shelter<Us>(pos, relative_square(Us, SQ_G1), shelter);
238 if (pos.can_castle(Us | QUEEN_SIDE))
239 evaluate_shelter<Us>(pos, relative_square(Us, SQ_C1), shelter);
241 return shelter - make_score(VALUE_ZERO, 16 * minPawnDist);
244 // Explicit template instantiation
245 template Score Entry::do_king_safety<WHITE>(const Position& pos);
246 template Score Entry::do_king_safety<BLACK>(const Position& pos);