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 #ifndef ENDGAME_H_INCLUDED
21 #define ENDGAME_H_INCLUDED
30 /// EndgameType lists all supported endgames
34 // Evaluation functions
37 KXK, // Generic "mate lone king" eval
46 KmmKm, // K and two minors vs K and one or two minors
52 KBPsK, // KB+pawns vs K
53 KQKRPs, // KQ vs KR+pawns
56 KRPPKRP, // KRPP vs KRP
57 KPsK, // King and pawns vs king
67 /// Endgame functions can be of two types depending on whether they return a
68 /// Value or a ScaleFactor. Type eg_fun<int>::type returns either ScaleFactor
69 /// or Value depending on whether the template parameter is 0 or 1.
71 template<int> struct eg_fun { typedef Value type; };
72 template<> struct eg_fun<1> { typedef ScaleFactor type; };
75 /// Base and derived templates for endgame evaluation and scaling functions
80 virtual ~EndgameBase() {}
81 virtual Color color() const = 0;
82 virtual T operator()(const Position&) const = 0;
86 template<EndgameType E, typename T = typename eg_fun<(E > SCALE_FUNS)>::type>
87 struct Endgame : public EndgameBase<T> {
89 explicit Endgame(Color c) : strongSide(c), weakSide(~c) {}
90 Color color() const { return strongSide; }
91 T operator()(const Position&) const;
94 const Color strongSide, weakSide;
98 /// The Endgames class stores the pointers to endgame evaluation and scaling
99 /// base objects in two std::map typedefs. We then use polymorphism to invoke
100 /// the actual endgame function by calling its virtual operator().
104 typedef std::map<Key, EndgameBase<eg_fun<0>::type>*> M1;
105 typedef std::map<Key, EndgameBase<eg_fun<1>::type>*> M2;
110 M1& map(M1::mapped_type) { return m1; }
111 M2& map(M2::mapped_type) { return m2; }
113 template<EndgameType E> void add(const std::string& code);
119 template<typename T> T probe(Key key, T& eg)
120 { return eg = map(eg).count(key) ? map(eg)[key] : NULL; }
123 #endif // #ifndef ENDGAME_H_INCLUDED