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-2010 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/>.
34 //// Local definitions
39 /// Constants and variables
41 #define S(mg, eg) make_score(mg, eg)
43 // Doubled pawn penalty by opposed flag and file
44 const Score DoubledPawnPenalty[2][8] = {
45 { S(13, 43), S(20, 48), S(23, 48), S(23, 48),
46 S(23, 48), S(23, 48), S(20, 48), S(13, 43) },
47 { S(13, 43), S(20, 48), S(23, 48), S(23, 48),
48 S(23, 48), S(23, 48), S(20, 48), S(13, 43) }};
50 // Isolated pawn penalty by opposed flag and file
51 const Score IsolatedPawnPenalty[2][8] = {
52 { S(37, 45), S(54, 52), S(60, 52), S(60, 52),
53 S(60, 52), S(60, 52), S(54, 52), S(37, 45) },
54 { S(25, 30), S(36, 35), S(40, 35), S(40, 35),
55 S(40, 35), S(40, 35), S(36, 35), S(25, 30) }};
57 // Backward pawn penalty by opposed flag and file
58 const Score BackwardPawnPenalty[2][8] = {
59 { S(30, 42), S(43, 46), S(49, 46), S(49, 46),
60 S(49, 46), S(49, 46), S(43, 46), S(30, 42) },
61 { S(20, 28), S(29, 31), S(33, 31), S(33, 31),
62 S(33, 31), S(33, 31), S(29, 31), S(20, 28) }};
64 // Pawn chain membership bonus by file
65 const Score ChainBonus[8] = {
66 S(11,-1), S(13,-1), S(13,-1), S(14,-1),
67 S(14,-1), S(13,-1), S(13,-1), S(11,-1)
70 // Candidate passed pawn bonus by rank
71 const Score CandidateBonus[8] = {
72 S( 0, 0), S( 6, 13), S(6,13), S(14,29),
73 S(34,68), S(83,166), S(0, 0), S( 0, 0)
84 /// PawnInfoTable c'tor and d'tor instantiated one each thread
86 PawnInfoTable::PawnInfoTable() {
88 entries = new PawnInfo[PawnTableSize];
92 std::cerr << "Failed to allocate " << (PawnTableSize * sizeof(PawnInfo))
93 << " bytes for pawn hash table." << std::endl;
94 Application::exit_with_failure();
96 memset(entries, 0, PawnTableSize * sizeof(PawnInfo));
100 PawnInfoTable::~PawnInfoTable() {
106 /// PawnInfoTable::get_pawn_info() takes a position object as input, computes
107 /// a PawnInfo object, and returns a pointer to it. The result is also stored
108 /// in a hash table, so we don't have to recompute everything when the same
109 /// pawn structure occurs again.
111 PawnInfo* PawnInfoTable::get_pawn_info(const Position& pos) const {
115 Key key = pos.get_pawn_key();
116 unsigned index = unsigned(key & (PawnTableSize - 1));
117 PawnInfo* pi = entries + index;
119 // If pi->key matches the position's pawn hash key, it means that we
120 // have analysed this pawn structure before, and we can simply return
121 // the information we found the last time instead of recomputing it.
125 // Clear the PawnInfo object, and set the key
126 memset(pi, 0, sizeof(PawnInfo));
127 pi->kingSquares[WHITE] = pi->kingSquares[BLACK] = SQ_NONE;
130 // Calculate pawn attacks
131 Bitboard whitePawns = pos.pieces(PAWN, WHITE);
132 Bitboard blackPawns = pos.pieces(PAWN, BLACK);
133 pi->pawnAttacks[WHITE] = ((whitePawns << 9) & ~FileABB) | ((whitePawns << 7) & ~FileHBB);
134 pi->pawnAttacks[BLACK] = ((blackPawns >> 7) & ~FileABB) | ((blackPawns >> 9) & ~FileHBB);
136 // Evaluate pawns for both colors
137 pi->value = evaluate_pawns<WHITE>(pos, whitePawns, blackPawns, pi)
138 - evaluate_pawns<BLACK>(pos, blackPawns, whitePawns, pi);
143 /// PawnInfoTable::evaluate_pawns() evaluates each pawn of the given color
146 Score PawnInfoTable::evaluate_pawns(const Position& pos, Bitboard ourPawns,
147 Bitboard theirPawns, PawnInfo* pi) const {
152 bool passed, isolated, doubled, opposed, chain, backward, candidate;
153 Score value = SCORE_ZERO;
154 const BitCountType Max15 = CpuIs64Bit ? CNT64_MAX15 : CNT32_MAX15;
155 const Square* ptr = pos.piece_list_begin(Us, PAWN);
157 // Initialize halfOpenFiles[]
158 for (f = FILE_A; f <= FILE_H; f++)
159 if (!(ourPawns & file_bb(f)))
160 pi->halfOpenFiles[Us] |= (1 << f);
162 // Loop through all pawns of the current color and score each pawn
163 while ((s = *ptr++) != SQ_NONE)
165 assert(pos.piece_on(s) == piece_of_color_and_type(Us, PAWN));
170 // Our rank plus previous one. Used for chain detection.
171 b = rank_bb(r) | rank_bb(Us == WHITE ? r - Rank(1) : r + Rank(1));
173 // Passed, isolated, doubled or member of a pawn
174 // chain (but not the backward one) ?
175 passed = !(theirPawns & passed_pawn_mask(Us, s));
176 doubled = ourPawns & squares_behind(Us, s);
177 opposed = theirPawns & squares_in_front_of(Us, s);
178 isolated = !(ourPawns & neighboring_files_bb(f));
179 chain = ourPawns & neighboring_files_bb(f) & b;
181 // Test for backward pawn
185 // If the pawn is passed, isolated, or member of a pawn chain
186 // it cannot be backward. If can capture an enemy pawn or if
187 // there are friendly pawns behind on neighboring files it cannot
188 // be backward either.
189 if ( !(passed | isolated | chain)
190 && !(ourPawns & attack_span_mask(opposite_color(Us), s))
191 && !(pos.attacks_from<PAWN>(s, Us) & theirPawns))
193 // We now know that there are no friendly pawns beside or behind this
194 // pawn on neighboring files. We now check whether the pawn is
195 // backward by looking in the forward direction on the neighboring
196 // files, and seeing whether we meet a friendly or an enemy pawn first.
197 b = pos.attacks_from<PAWN>(s, Us);
199 // Note that we are sure to find something because pawn is not passed
200 // nor isolated, so loop is potentially infinite, but it isn't.
201 while (!(b & (ourPawns | theirPawns)))
202 Us == WHITE ? b <<= 8 : b >>= 8;
204 // The friendly pawn needs to be at least two ranks closer than the enemy
205 // pawn in order to help the potentially backward pawn advance.
206 backward = (b | (Us == WHITE ? b << 8 : b >> 8)) & theirPawns;
209 assert(passed | opposed | (attack_span_mask(Us, s) & theirPawns));
211 // Test for candidate passed pawn
212 candidate = !(opposed | passed)
213 && (b = attack_span_mask(opposite_color(Us), s + pawn_push(Us)) & ourPawns) != EmptyBoardBB
214 && count_1s<Max15>(b) >= count_1s<Max15>(attack_span_mask(Us, s) & theirPawns);
216 // In order to prevent doubled passed pawns from receiving a too big
217 // bonus, only the frontmost passed pawn on each file is considered as
218 // a true passed pawn.
219 if (passed && (ourPawns & squares_in_front_of(Us, s)))
222 // Mark the pawn as passed. Pawn will be properly scored in evaluation
223 // because we need full attack info to evaluate passed pawns.
225 set_bit(&(pi->passedPawns[Us]), s);
229 value -= IsolatedPawnPenalty[opposed][f];
232 value -= DoubledPawnPenalty[opposed][f];
235 value -= BackwardPawnPenalty[opposed][f];
238 value += ChainBonus[f];
241 value += CandidateBonus[relative_rank(Us, s)];