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/>.
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 RedundantQueenPenalty = Value(320);
39 const Value RedundantRookPenalty = Value(554);
41 const int LinearCoefficients[6] = { 1617, -162, -1172, -190, 105, 26 };
43 const int QuadraticCoefficientsSameColor[][8] = {
44 { 7, 7, 7, 7, 7, 7 }, { 39, 2, 7, 7, 7, 7 }, { 35, 271, -4, 7, 7, 7 },
45 { 7, 25, 4, 7, 7, 7 }, { -27, -2, 46, 100, 56, 7 }, { 58, 29, 83, 148, -3, -25 } };
47 const int QuadraticCoefficientsOppositeColor[][8] = {
48 { 41, 41, 41, 41, 41, 41 }, { 37, 41, 41, 41, 41, 41 }, { 10, 62, 41, 41, 41, 41 },
49 { 57, 64, 39, 41, 41, 41 }, { 50, 40, 23, -22, 41, 41 }, { 106, 101, 3, 151, 171, 41 } };
51 // Endgame evaluation and scaling functions accessed direcly and not through
52 // the function maps because correspond to more then one material hash key.
53 Endgame<KmmKm> EvaluateKmmKm[] = { Endgame<KmmKm>(WHITE), Endgame<KmmKm>(BLACK) };
54 Endgame<KXK> EvaluateKXK[] = { Endgame<KXK>(WHITE), Endgame<KXK>(BLACK) };
56 Endgame<KBPsK> ScaleKBPsK[] = { Endgame<KBPsK>(WHITE), Endgame<KBPsK>(BLACK) };
57 Endgame<KQKRPs> ScaleKQKRPs[] = { Endgame<KQKRPs>(WHITE), Endgame<KQKRPs>(BLACK) };
58 Endgame<KPsK> ScaleKPsK[] = { Endgame<KPsK>(WHITE), Endgame<KPsK>(BLACK) };
59 Endgame<KPKP> ScaleKPKP[] = { Endgame<KPKP>(WHITE), Endgame<KPKP>(BLACK) };
61 // Helper templates used to detect a given material distribution
62 template<Color Us> bool is_KXK(const Position& pos) {
63 const Color Them = (Us == WHITE ? BLACK : WHITE);
64 return pos.non_pawn_material(Them) == VALUE_ZERO
65 && pos.piece_count(Them, PAWN) == 0
66 && pos.non_pawn_material(Us) >= RookValueMidgame;
69 template<Color Us> bool is_KBPsKs(const Position& pos) {
70 return pos.non_pawn_material(Us) == BishopValueMidgame
71 && pos.piece_count(Us, BISHOP) == 1
72 && pos.piece_count(Us, PAWN) >= 1;
75 template<Color Us> bool is_KQKRPs(const Position& pos) {
76 const Color Them = (Us == WHITE ? BLACK : WHITE);
77 return pos.piece_count(Us, PAWN) == 0
78 && pos.non_pawn_material(Us) == QueenValueMidgame
79 && pos.piece_count(Us, QUEEN) == 1
80 && pos.piece_count(Them, ROOK) == 1
81 && pos.piece_count(Them, PAWN) >= 1;
87 /// MaterialInfoTable c'tor and d'tor allocate and free the space for Endgames
89 void MaterialInfoTable::init() { Base::init(); if (!funcs) funcs = new Endgames(); }
90 MaterialInfoTable::~MaterialInfoTable() { delete funcs; }
93 /// MaterialInfoTable::get_material_info() takes a position object as input,
94 /// computes or looks up a MaterialInfo object, and returns a pointer to it.
95 /// If the material configuration is not already present in the table, it
96 /// is stored there, so we don't have to recompute everything when the
97 /// same material configuration occurs again.
99 MaterialInfo* MaterialInfoTable::get_material_info(const Position& pos) const {
101 Key key = pos.get_material_key();
102 MaterialInfo* mi = probe(key);
104 // If mi->key matches the position's material hash key, it means that we
105 // have analysed this material configuration before, and we can simply
106 // return the information we found the last time instead of recomputing it.
110 // Initialize MaterialInfo entry
111 memset(mi, 0, sizeof(MaterialInfo));
113 mi->factor[WHITE] = mi->factor[BLACK] = (uint8_t)SCALE_FACTOR_NORMAL;
116 mi->gamePhase = MaterialInfoTable::game_phase(pos);
118 // Let's look if we have a specialized evaluation function for this
119 // particular material configuration. First we look for a fixed
120 // configuration one, then a generic one if previous search failed.
121 if ((mi->evaluationFunction = funcs->get<Value>(key)) != NULL)
124 if (is_KXK<WHITE>(pos))
126 mi->evaluationFunction = &EvaluateKXK[WHITE];
130 if (is_KXK<BLACK>(pos))
132 mi->evaluationFunction = &EvaluateKXK[BLACK];
136 if (!pos.pieces(PAWN) && !pos.pieces(ROOK) && !pos.pieces(QUEEN))
138 // Minor piece endgame with at least one minor piece per side and
139 // no pawns. Note that the case KmmK is already handled by KXK.
140 assert((pos.pieces(KNIGHT, WHITE) | pos.pieces(BISHOP, WHITE)));
141 assert((pos.pieces(KNIGHT, BLACK) | pos.pieces(BISHOP, BLACK)));
143 if ( pos.piece_count(WHITE, BISHOP) + pos.piece_count(WHITE, KNIGHT) <= 2
144 && pos.piece_count(BLACK, BISHOP) + pos.piece_count(BLACK, KNIGHT) <= 2)
146 mi->evaluationFunction = &EvaluateKmmKm[WHITE];
151 // OK, we didn't find any special evaluation function for the current
152 // material configuration. Is there a suitable scaling function?
154 // We face problems when there are several conflicting applicable
155 // scaling functions and we need to decide which one to use.
156 EndgameBase<ScaleFactor>* sf;
158 if ((sf = funcs->get<ScaleFactor>(key)) != NULL)
160 mi->scalingFunction[sf->color()] = sf;
164 // Generic scaling functions that refer to more then one material
165 // distribution. Should be probed after the specialized ones.
166 // Note that these ones don't return after setting the function.
167 if (is_KBPsKs<WHITE>(pos))
168 mi->scalingFunction[WHITE] = &ScaleKBPsK[WHITE];
170 if (is_KBPsKs<BLACK>(pos))
171 mi->scalingFunction[BLACK] = &ScaleKBPsK[BLACK];
173 if (is_KQKRPs<WHITE>(pos))
174 mi->scalingFunction[WHITE] = &ScaleKQKRPs[WHITE];
176 else if (is_KQKRPs<BLACK>(pos))
177 mi->scalingFunction[BLACK] = &ScaleKQKRPs[BLACK];
179 Value npm_w = pos.non_pawn_material(WHITE);
180 Value npm_b = pos.non_pawn_material(BLACK);
182 if (npm_w + npm_b == VALUE_ZERO)
184 if (pos.piece_count(BLACK, PAWN) == 0)
186 assert(pos.piece_count(WHITE, PAWN) >= 2);
187 mi->scalingFunction[WHITE] = &ScaleKPsK[WHITE];
189 else if (pos.piece_count(WHITE, PAWN) == 0)
191 assert(pos.piece_count(BLACK, PAWN) >= 2);
192 mi->scalingFunction[BLACK] = &ScaleKPsK[BLACK];
194 else if (pos.piece_count(WHITE, PAWN) == 1 && pos.piece_count(BLACK, PAWN) == 1)
196 // This is a special case because we set scaling functions
197 // for both colors instead of only one.
198 mi->scalingFunction[WHITE] = &ScaleKPKP[WHITE];
199 mi->scalingFunction[BLACK] = &ScaleKPKP[BLACK];
203 // No pawns makes it difficult to win, even with a material advantage
204 if (pos.piece_count(WHITE, PAWN) == 0 && npm_w - npm_b <= BishopValueMidgame)
206 mi->factor[WHITE] = uint8_t
207 (npm_w == npm_b || npm_w < RookValueMidgame ? 0 : NoPawnsSF[std::min(pos.piece_count(WHITE, BISHOP), 2)]);
210 if (pos.piece_count(BLACK, PAWN) == 0 && npm_b - npm_w <= BishopValueMidgame)
212 mi->factor[BLACK] = uint8_t
213 (npm_w == npm_b || npm_b < RookValueMidgame ? 0 : NoPawnsSF[std::min(pos.piece_count(BLACK, BISHOP), 2)]);
216 // Compute the space weight
217 if (npm_w + npm_b >= 2 * QueenValueMidgame + 4 * RookValueMidgame + 2 * KnightValueMidgame)
219 int minorPieceCount = pos.piece_count(WHITE, KNIGHT) + pos.piece_count(WHITE, BISHOP)
220 + pos.piece_count(BLACK, KNIGHT) + pos.piece_count(BLACK, BISHOP);
222 mi->spaceWeight = minorPieceCount * minorPieceCount;
225 // Evaluate the material imbalance. We use PIECE_TYPE_NONE as a place holder
226 // for the bishop pair "extended piece", this allow us to be more flexible
227 // in defining bishop pair bonuses.
228 const int pieceCount[2][8] = {
229 { pos.piece_count(WHITE, BISHOP) > 1, pos.piece_count(WHITE, PAWN), pos.piece_count(WHITE, KNIGHT),
230 pos.piece_count(WHITE, BISHOP) , pos.piece_count(WHITE, ROOK), pos.piece_count(WHITE, QUEEN) },
231 { pos.piece_count(BLACK, BISHOP) > 1, pos.piece_count(BLACK, PAWN), pos.piece_count(BLACK, KNIGHT),
232 pos.piece_count(BLACK, BISHOP) , pos.piece_count(BLACK, ROOK), pos.piece_count(BLACK, QUEEN) } };
234 mi->value = int16_t((imbalance<WHITE>(pieceCount) - imbalance<BLACK>(pieceCount)) / 16);
239 /// MaterialInfoTable::imbalance() calculates imbalance comparing piece count of each
240 /// piece type for both colors.
243 int MaterialInfoTable::imbalance(const int pieceCount[][8]) {
245 const Color Them = (Us == WHITE ? BLACK : WHITE);
250 // Redundancy of major pieces, formula based on Kaufman's paper
251 // "The Evaluation of Material Imbalances in Chess"
252 if (pieceCount[Us][ROOK] > 0)
253 value -= RedundantRookPenalty * (pieceCount[Us][ROOK] - 1)
254 + RedundantQueenPenalty * pieceCount[Us][QUEEN];
256 // Second-degree polynomial material imbalance by Tord Romstad
257 for (pt1 = PIECE_TYPE_NONE; pt1 <= QUEEN; pt1++)
259 pc = pieceCount[Us][pt1];
263 v = LinearCoefficients[pt1];
265 for (pt2 = PIECE_TYPE_NONE; pt2 <= pt1; pt2++)
266 v += QuadraticCoefficientsSameColor[pt1][pt2] * pieceCount[Us][pt2]
267 + QuadraticCoefficientsOppositeColor[pt1][pt2] * pieceCount[Them][pt2];
275 /// MaterialInfoTable::game_phase() calculates the phase given the current
276 /// position. Because the phase is strictly a function of the material, it
277 /// is stored in MaterialInfo.
279 Phase MaterialInfoTable::game_phase(const Position& pos) {
281 Value npm = pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK);
283 return npm >= MidgameLimit ? PHASE_MIDGAME
284 : npm <= EndgameLimit ? PHASE_ENDGAME
285 : Phase(((npm - EndgameLimit) * 128) / (MidgameLimit - EndgameLimit));