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/>.
20 #include <algorithm> // For std::min
30 // Values modified by Joona Kiiski
31 const Value MidgameLimit = Value(15581);
32 const Value EndgameLimit = Value(3998);
34 // Scale factors used when one side has no more pawns
35 const int NoPawnsSF[4] = { 6, 12, 32 };
37 // Polynomial material balance parameters
38 const Value RedundantMajor = Value(160);
40 // pair pawn knight bishop rook queen
41 const int LinearCoefficients[6] = { 1852, -162, -1122, -183, 302, 1 };
43 const int QuadraticCoefficientsSameColor[][PIECE_TYPE_NB] = {
44 // pair pawn knight bishop rook queen
47 { 35, 271, -4 }, // Knight
48 { 0, 105, 4, 0 }, // Bishop
49 { -27, -2, 46, 100, -141 }, // Rook
50 { 58, 29, 83, 148, -163, 0 } // Queen
53 const int QuadraticCoefficientsOppositeColor[][PIECE_TYPE_NB] = {
55 // pair pawn knight bishop rook queen
58 { 10, 62, 0 }, // Knight OUR PIECES
59 { 57, 64, 39, 0 }, // Bishop
60 { 50, 40, 23, -22, 0 }, // Rook
61 { 106, 101, 3, 151, 171, 0 } // Queen
64 // Endgame evaluation and scaling functions accessed direcly and not through
65 // the function maps because correspond to more then one material hash key.
66 Endgame<KmmKm> EvaluateKmmKm[] = { Endgame<KmmKm>(WHITE), Endgame<KmmKm>(BLACK) };
67 Endgame<KXK> EvaluateKXK[] = { Endgame<KXK>(WHITE), Endgame<KXK>(BLACK) };
69 Endgame<KBPsK> ScaleKBPsK[] = { Endgame<KBPsK>(WHITE), Endgame<KBPsK>(BLACK) };
70 Endgame<KQKRPs> ScaleKQKRPs[] = { Endgame<KQKRPs>(WHITE), Endgame<KQKRPs>(BLACK) };
71 Endgame<KPsK> ScaleKPsK[] = { Endgame<KPsK>(WHITE), Endgame<KPsK>(BLACK) };
72 Endgame<KPKP> ScaleKPKP[] = { Endgame<KPKP>(WHITE), Endgame<KPKP>(BLACK) };
74 // Helper templates used to detect a given material distribution
75 template<Color Us> bool is_KXK(const Position& pos) {
76 const Color Them = (Us == WHITE ? BLACK : WHITE);
77 return !pos.count<PAWN>(Them)
78 && pos.non_pawn_material(Them) == VALUE_ZERO
79 && pos.non_pawn_material(Us) >= RookValueMg;
82 template<Color Us> bool is_KBPsKs(const Position& pos) {
83 return pos.non_pawn_material(Us) == BishopValueMg
84 && pos.count<BISHOP>(Us) == 1
85 && pos.count<PAWN >(Us) >= 1;
88 template<Color Us> bool is_KQKRPs(const Position& pos) {
89 const Color Them = (Us == WHITE ? BLACK : WHITE);
90 return !pos.count<PAWN>(Us)
91 && pos.non_pawn_material(Us) == QueenValueMg
92 && pos.count<QUEEN>(Us) == 1
93 && pos.count<ROOK>(Them) == 1
94 && pos.count<PAWN>(Them) >= 1;
97 /// imbalance() calculates imbalance comparing piece count of each
98 /// piece type for both colors.
101 int imbalance(const int pieceCount[][PIECE_TYPE_NB]) {
103 const Color Them = (Us == WHITE ? BLACK : WHITE);
108 // Penalty for major piece redundancy
109 if (pieceCount[Us][ROOK] + pieceCount[Us][QUEEN] > 1)
110 value -= RedundantMajor;
112 // Second-degree polynomial material imbalance by Tord Romstad
113 for (pt1 = NO_PIECE_TYPE; pt1 <= QUEEN; ++pt1)
115 pc = pieceCount[Us][pt1];
119 v = LinearCoefficients[pt1];
121 for (pt2 = NO_PIECE_TYPE; pt2 <= pt1; ++pt2)
122 v += QuadraticCoefficientsSameColor[pt1][pt2] * pieceCount[Us][pt2]
123 + QuadraticCoefficientsOppositeColor[pt1][pt2] * pieceCount[Them][pt2];
134 /// Material::probe() takes a position object as input, looks up a MaterialEntry
135 /// object, and returns a pointer to it. If the material configuration is not
136 /// already present in the table, it is computed and stored there, so we don't
137 /// have to recompute everything when the same material configuration occurs again.
139 Entry* probe(const Position& pos, Table& entries, Endgames& endgames) {
141 Key key = pos.material_key();
142 Entry* e = entries[key];
144 // If e->key matches the position's material hash key, it means that we
145 // have analysed this material configuration before, and we can simply
146 // return the information we found the last time instead of recomputing it.
150 std::memset(e, 0, sizeof(Entry));
152 e->factor[WHITE] = e->factor[BLACK] = (uint8_t)SCALE_FACTOR_NORMAL;
153 e->gamePhase = game_phase(pos);
155 // Let's look if we have a specialized evaluation function for this
156 // particular material configuration. First we look for a fixed
157 // configuration one, then a generic one if previous search failed.
158 if (endgames.probe(key, e->evaluationFunction))
161 if (is_KXK<WHITE>(pos))
163 e->evaluationFunction = &EvaluateKXK[WHITE];
167 if (is_KXK<BLACK>(pos))
169 e->evaluationFunction = &EvaluateKXK[BLACK];
173 if (!pos.pieces(PAWN) && !pos.pieces(ROOK) && !pos.pieces(QUEEN))
175 // Minor piece endgame with at least one minor piece per side and
176 // no pawns. Note that the case KmmK is already handled by KXK.
177 assert((pos.pieces(WHITE, KNIGHT) | pos.pieces(WHITE, BISHOP)));
178 assert((pos.pieces(BLACK, KNIGHT) | pos.pieces(BLACK, BISHOP)));
180 if ( pos.count<BISHOP>(WHITE) + pos.count<KNIGHT>(WHITE) <= 2
181 && pos.count<BISHOP>(BLACK) + pos.count<KNIGHT>(BLACK) <= 2)
183 e->evaluationFunction = &EvaluateKmmKm[pos.side_to_move()];
188 // OK, we didn't find any special evaluation function for the current
189 // material configuration. Is there a suitable scaling function?
191 // We face problems when there are several conflicting applicable
192 // scaling functions and we need to decide which one to use.
193 EndgameBase<ScaleFactor>* sf;
195 if (endgames.probe(key, sf))
197 e->scalingFunction[sf->color()] = sf;
201 // Generic scaling functions that refer to more then one material
202 // distribution. Should be probed after the specialized ones.
203 // Note that these ones don't return after setting the function.
204 if (is_KBPsKs<WHITE>(pos))
205 e->scalingFunction[WHITE] = &ScaleKBPsK[WHITE];
207 if (is_KBPsKs<BLACK>(pos))
208 e->scalingFunction[BLACK] = &ScaleKBPsK[BLACK];
210 if (is_KQKRPs<WHITE>(pos))
211 e->scalingFunction[WHITE] = &ScaleKQKRPs[WHITE];
213 else if (is_KQKRPs<BLACK>(pos))
214 e->scalingFunction[BLACK] = &ScaleKQKRPs[BLACK];
216 Value npm_w = pos.non_pawn_material(WHITE);
217 Value npm_b = pos.non_pawn_material(BLACK);
219 if (npm_w + npm_b == VALUE_ZERO)
221 if (!pos.count<PAWN>(BLACK))
223 assert(pos.count<PAWN>(WHITE) >= 2);
224 e->scalingFunction[WHITE] = &ScaleKPsK[WHITE];
226 else if (!pos.count<PAWN>(WHITE))
228 assert(pos.count<PAWN>(BLACK) >= 2);
229 e->scalingFunction[BLACK] = &ScaleKPsK[BLACK];
231 else if (pos.count<PAWN>(WHITE) == 1 && pos.count<PAWN>(BLACK) == 1)
233 // This is a special case because we set scaling functions
234 // for both colors instead of only one.
235 e->scalingFunction[WHITE] = &ScaleKPKP[WHITE];
236 e->scalingFunction[BLACK] = &ScaleKPKP[BLACK];
240 // No pawns makes it difficult to win, even with a material advantage. This
241 // catches some trivial draws like KK, KBK and KNK
242 if (!pos.count<PAWN>(WHITE) && npm_w - npm_b <= BishopValueMg)
244 e->factor[WHITE] = (uint8_t)
245 (npm_w == npm_b || npm_w < RookValueMg ? 0 : NoPawnsSF[std::min(pos.count<BISHOP>(WHITE), 2)]);
248 if (!pos.count<PAWN>(BLACK) && npm_b - npm_w <= BishopValueMg)
250 e->factor[BLACK] = (uint8_t)
251 (npm_w == npm_b || npm_b < RookValueMg ? 0 : NoPawnsSF[std::min(pos.count<BISHOP>(BLACK), 2)]);
254 // Compute the space weight
255 if (npm_w + npm_b >= 2 * QueenValueMg + 4 * RookValueMg + 2 * KnightValueMg)
257 int minorPieceCount = pos.count<KNIGHT>(WHITE) + pos.count<BISHOP>(WHITE)
258 + pos.count<KNIGHT>(BLACK) + pos.count<BISHOP>(BLACK);
260 e->spaceWeight = make_score(minorPieceCount * minorPieceCount, 0);
263 // Evaluate the material imbalance. We use PIECE_TYPE_NONE as a place holder
264 // for the bishop pair "extended piece", this allow us to be more flexible
265 // in defining bishop pair bonuses.
266 const int pieceCount[COLOR_NB][PIECE_TYPE_NB] = {
267 { pos.count<BISHOP>(WHITE) > 1, pos.count<PAWN>(WHITE), pos.count<KNIGHT>(WHITE),
268 pos.count<BISHOP>(WHITE) , pos.count<ROOK>(WHITE), pos.count<QUEEN >(WHITE) },
269 { pos.count<BISHOP>(BLACK) > 1, pos.count<PAWN>(BLACK), pos.count<KNIGHT>(BLACK),
270 pos.count<BISHOP>(BLACK) , pos.count<ROOK>(BLACK), pos.count<QUEEN >(BLACK) } };
272 e->value = (int16_t)((imbalance<WHITE>(pieceCount) - imbalance<BLACK>(pieceCount)) / 16);
277 /// Material::game_phase() calculates the phase given the current
278 /// position. Because the phase is strictly a function of the material, it
279 /// is stored in MaterialEntry.
281 Phase game_phase(const Position& pos) {
283 Value npm = pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK);
285 return npm >= MidgameLimit ? PHASE_MIDGAME
286 : npm <= EndgameLimit ? PHASE_ENDGAME
287 : Phase(((npm - EndgameLimit) * 128) / (MidgameLimit - EndgameLimit));
290 } // namespace Material