/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
+ Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
-
#if !defined(ENDGAME_H_INCLUDED)
#define ENDGAME_H_INCLUDED
-////
-//// Includes
-////
+#include <map>
+#include <string>
#include "position.h"
-#include "scale.h"
-#include "value.h"
+#include "types.h"
-////
-//// Types
-////
+/// EndgameType lists all supported endgames
enum EndgameType {
- // Evaluation functions
- KXK, // Generic "mate lone king" eval
- KBNK, // KBN vs K
- KPK, // KP vs K
- KRKP, // KR vs KP
- KRKB, // KR vs KB
- KRKN, // KR vs KN
- KQKR, // KQ vs KR
- KBBKN, // KBB vs KN
- KNNK, // KNN vs K
- KmmKm, // K and two minors vs K and one or two minors
-
- // Scaling functions
- KBPsK, // KB+pawns vs K
- KQKRPs, // KQ vs KR+pawns
- KRPKR, // KRP vs KR
- KRPPKRP, // KRPP vs KRP
- KPsK, // King and pawns vs king
- KBPKB, // KBP vs KB
- KBPPKB, // KBPP vs KB
- KBPKN, // KBP vs KN
- KNPK, // KNP vs K
- KPKP // KP vs KP
+ // Evaluation functions
+
+ KXK, // Generic "mate lone king" eval
+ KBNK, // KBN vs K
+ KPK, // KP vs K
+ KRKP, // KR vs KP
+ KRKB, // KR vs KB
+ KRKN, // KR vs KN
+ KQKR, // KQ vs KR
+ KBBKN, // KBB vs KN
+ KNNK, // KNN vs K
+ KmmKm, // K and two minors vs K and one or two minors
+
+
+ // Scaling functions
+ SCALE_FUNS,
+
+ KBPsK, // KB+pawns vs K
+ KQKRPs, // KQ vs KR+pawns
+ KRPKR, // KRP vs KR
+ KRPPKRP, // KRPP vs KRP
+ KPsK, // King and pawns vs king
+ KBPKB, // KBP vs KB
+ KBPPKB, // KBPP vs KB
+ KBPKN, // KBP vs KN
+ KNPK, // KNP vs K
+ KPKP // KP vs KP
};
-/// Template abstract base class for all special endgame functions
+
+/// Endgame functions can be of two types according if return a Value or a
+/// ScaleFactor. Type eg_fun<int>::type equals to either ScaleFactor or Value
+/// depending if the template parameter is 0 or 1.
+
+template<int> struct eg_fun { typedef Value type; };
+template<> struct eg_fun<1> { typedef ScaleFactor type; };
+
+
+/// Base and derived templates for endgame evaluation and scaling functions
template<typename T>
-class EndgameFunctionBase {
-public:
- EndgameFunctionBase(Color c) : strongerSide(c), weakerSide(opposite_color(c)) {}
- virtual ~EndgameFunctionBase() {}
- virtual T apply(const Position&) = 0;
+struct EndgameBase {
+
+ virtual ~EndgameBase() {}
+ virtual Color color() const = 0;
+ virtual T operator()(const Position&) const = 0;
+};
+
+
+template<EndgameType E, typename T = typename eg_fun<(E > SCALE_FUNS)>::type>
+struct Endgame : public EndgameBase<T> {
+
+ explicit Endgame(Color c) : strongerSide(c), weakerSide(~c) {}
Color color() const { return strongerSide; }
+ T operator()(const Position&) const;
-protected:
+private:
Color strongerSide, weakerSide;
};
-typedef EndgameFunctionBase<Value> EndgameEvaluationFunctionBase;
-typedef EndgameFunctionBase<ScaleFactor> EndgameScalingFunctionBase;
+/// Endgames class stores in two std::map the pointers to endgame evaluation
+/// and scaling base objects. Then we use polymorphism to invoke the actual
+/// endgame function calling its operator() that is virtual.
-/// Templates subclass for various concrete endgames
+class Endgames {
-template<EndgameType>
-struct EvaluationFunction : public EndgameEvaluationFunctionBase {
- typedef EndgameEvaluationFunctionBase Base;
- explicit EvaluationFunction(Color c): EndgameEvaluationFunctionBase(c) {}
- Value apply(const Position&);
-};
+ typedef std::map<Key, EndgameBase<eg_fun<0>::type>*> M1;
+ typedef std::map<Key, EndgameBase<eg_fun<1>::type>*> M2;
-template<EndgameType>
-struct ScalingFunction : public EndgameScalingFunctionBase {
- typedef EndgameScalingFunctionBase Base;
- explicit ScalingFunction(Color c) : EndgameScalingFunctionBase(c) {}
- ScaleFactor apply(const Position&);
-};
+ M1 m1;
+ M2 m2;
+ M1& map(M1::mapped_type) { return m1; }
+ M2& map(M2::mapped_type) { return m2; }
-////
-//// Prototypes
-////
+ template<EndgameType E> void add(const std::string& code);
-extern void init_bitbases();
+public:
+ Endgames();
+ ~Endgames();
+ template<typename T> T probe(Key key, T& eg)
+ { return eg = map(eg).count(key) ? map(eg)[key] : NULL; }
+};
#endif // !defined(ENDGAME_H_INCLUDED)