/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2009 Marco Costalba
+ Copyright (C) 2008-2010 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 <string>
+#include <map>
#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
- KmmKm, // K and two minors vs K and one or two minors
-
- // Scaling functions
- KBPK, // KBP vs K
- KQKRP, // KQ vs KRP
- 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
+
+/// Some magic to detect family type of endgame from its enum value
+
+template<bool> struct bool_to_type { typedef Value type; };
+template<> struct bool_to_type<true> { typedef ScaleFactor type; };
+template<EndgameType E> struct eg_family : public bool_to_type<(E > SCALE_FUNS)> {};
+
+
+/// 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 {
-protected:
- Color strongerSide, weakerSide;
+ virtual ~EndgameBase() {}
+ virtual Color color() const = 0;
+ virtual T operator()(const Position&) const = 0;
};
-typedef EndgameFunctionBase<Value> EndgameEvaluationFunctionBase;
-typedef EndgameFunctionBase<ScaleFactor> EndgameScalingFunctionBase;
+template<EndgameType E, typename T = typename eg_family<E>::type>
+struct Endgame : public EndgameBase<T> {
-/// Templates subclass for various concrete endgames
+ explicit Endgame(Color c) : strongerSide(c), weakerSide(flip(c)) {}
+ Color color() const { return strongerSide; }
+ T operator()(const Position&) const;
-template<EndgameType>
-struct EvaluationFunction : public EndgameEvaluationFunctionBase {
- explicit EvaluationFunction(Color c): EndgameEvaluationFunctionBase(c) {}
- Value apply(const Position&);
+private:
+ Color strongerSide, weakerSide;
};
-template<EndgameType>
-struct ScalingFunction : public EndgameScalingFunctionBase {
- explicit ScalingFunction(Color c) : EndgameScalingFunctionBase(c) {}
- ScaleFactor apply(const Position&);
-};
+/// 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 apply() method that is virtual.
+
+struct Endgames {
+
+ template<typename T>
+ struct Map { typedef std::map<Key, EndgameBase<T>*> type; };
+
+ typedef Map<Value>::type M1;
+ typedef Map<ScaleFactor>::type M2;
-////
-//// Prototypes
-////
+ Endgames();
+ ~Endgames();
-extern void init_bitbases();
+ template<typename T>
+ EndgameBase<T>* get(Key key) const {
+ typedef typename Map<T>::type M;
+ typename M::const_iterator it = map<M>().find(key);
+ return it != map<M>().end() ? it->second : NULL;
+ }
+
+private:
+ template<EndgameType E> void add(const std::string& keyCode);
+ template<typename M> const M& map() const;
+
+ M1 m1;
+ M2 m2;
+};
#endif // !defined(ENDGAME_H_INCLUDED)