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-2012 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 #if !defined(ENDGAME_H_INCLUDED)
21 #define ENDGAME_H_INCLUDED
30 /// EndgameType lists all supported endgames
34 // Evaluation functions
36 KXK, // Generic "mate lone king" eval
45 KmmKm, // K and two minors vs K and one or two minors
51 KBPsK, // KB+pawns vs K
52 KQKRPs, // KQ vs KR+pawns
54 KRPPKRP, // KRPP vs KRP
55 KPsK, // King and pawns vs king
64 /// Endgame functions can be of two types according if return a Value or a
65 /// ScaleFactor. Type eg_fun<int>::type equals to either ScaleFactor or Value
66 /// depending if the template parameter is 0 or 1.
68 template<int> struct eg_fun { typedef Value type; };
69 template<> struct eg_fun<1> { typedef ScaleFactor type; };
72 /// Base and derived templates for endgame evaluation and scaling functions
77 virtual ~EndgameBase() {}
78 virtual Color color() const = 0;
79 virtual T operator()(const Position&) const = 0;
83 template<EndgameType E, typename T = typename eg_fun<(E > SCALE_FUNS)>::type>
84 struct Endgame : public EndgameBase<T> {
86 explicit Endgame(Color c) : strongerSide(c), weakerSide(~c) {}
87 Color color() const { return strongerSide; }
88 T operator()(const Position&) const;
91 Color strongerSide, weakerSide;
95 /// Endgames class stores in two std::map the pointers to endgame evaluation
96 /// and scaling base objects. Then we use polymorphism to invoke the actual
97 /// endgame function calling its operator() that is virtual.
101 typedef std::map<Key, EndgameBase<eg_fun<0>::type>*> M1;
102 typedef std::map<Key, EndgameBase<eg_fun<1>::type>*> M2;
107 M1& map(M1::mapped_type) { return m1; }
108 M2& map(M2::mapped_type) { return m2; }
110 template<EndgameType E> void add(const std::string& code);
116 template<typename T> T probe(Key key, T& eg)
117 { return eg = map(eg).count(key) ? map(eg)[key] : NULL; }
120 #endif // !defined(ENDGAME_H_INCLUDED)