X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fendgame.h;h=5f6b4bbba09d044acf7db0bf93ad28e48b9fafec;hp=efc527a7f98f30980fd8677e3ab35568a4a78a36;hb=7c5d724724e826ff1fd9a97c8812d5a4bffaaa84;hpb=35018fa3076a01a62bd4433771c5832d0ddc52e8 diff --git a/src/endgame.h b/src/endgame.h index efc527a7..5f6b4bbb 100644 --- a/src/endgame.h +++ b/src/endgame.h @@ -1,7 +1,8 @@ /* 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-2015 Marco Costalba, Joona Kiiski, Tord Romstad + Copyright (C) 2015-2016 Marco Costalba, Joona Kiiski, Gary Linscott, 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 @@ -17,11 +18,14 @@ along with this program. If not, see . */ -#if !defined(ENDGAME_H_INCLUDED) +#ifndef ENDGAME_H_INCLUDED #define ENDGAME_H_INCLUDED -#include #include +#include +#include +#include +#include #include "position.h" #include "types.h" @@ -33,39 +37,39 @@ enum EndgameType { // Evaluation functions + KNNK, // KNN vs K 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 + KQKP, // KQ vs KP 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, + SCALING_FUNCTIONS, - KBPsK, // KB+pawns vs K - KQKRPs, // KQ vs KR+pawns + KBPsK, // KB and pawns vs K + KQKRPs, // KQ vs KR and pawns KRPKR, // KRP vs KR + KRPKB, // KRP vs KB KRPPKRP, // KRPP vs KRP - KPsK, // King and pawns vs king + KPsK, // K and pawns vs K KBPKB, // KBP vs KB KBPPKB, // KBPP vs KB KBPKN, // KBP vs KN KNPK, // KNP vs K + KNPKB, // KNP vs KB KPKP // KP vs KP }; -/// Some magic to detect family type of endgame from its enum value - -template struct bool_to_type { typedef Value type; }; -template<> struct bool_to_type { typedef ScaleFactor type; }; -template struct eg_family : public bool_to_type<(E > SCALE_FUNS)> {}; +/// Endgame functions can be of two types depending on whether they return a +/// Value or a ScaleFactor. +template using +eg_type = typename std::conditional<(E < SCALING_FUNCTIONS), Value, ScaleFactor>::type; /// Base and derived templates for endgame evaluation and scaling functions @@ -73,53 +77,49 @@ template struct eg_family : public bool_to_type<(E > SCALE_FUNS)> template struct EndgameBase { - virtual ~EndgameBase() {} - virtual Color color() const = 0; - virtual T apply(const Position&) const = 0; + virtual ~EndgameBase() = default; + virtual Color strong_side() const = 0; + virtual T operator()(const Position&) const = 0; }; -template::type> +template> struct Endgame : public EndgameBase { - explicit Endgame(Color c) : strongerSide(c), weakerSide(opposite_color(c)) {} - Color color() const { return strongerSide; } - T apply(const Position&) const; + explicit Endgame(Color c) : strongSide(c), weakSide(~c) {} + Color strong_side() const { return strongSide; } + T operator()(const Position&) const; private: - Color strongerSide, weakerSide; + Color strongSide, weakSide; }; -/// 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. +/// The Endgames class stores the pointers to endgame evaluation and scaling +/// base objects in two std::map. We use polymorphism to invoke the actual +/// endgame function by calling its virtual operator(). + +class Endgames { -struct Endgames { + template using Map = std::map>>; + + template> + void add(const std::string& code); template - struct Map { typedef std::map*> type; }; + Map& map() { + return std::get::value>(maps); + } - typedef Map::type M1; - typedef Map::type M2; + std::pair, Map> maps; +public: Endgames(); - ~Endgames(); template - EndgameBase* get(Key key) const { - - typedef typename Map::type M; - typename M::const_iterator it = map().find(key); - return it != map().end() ? it->second : NULL; + EndgameBase* probe(Key key) { + return map().count(key) ? map()[key].get() : nullptr; } - -private: - template void add(const std::string& keyCode); - template const M& map() const; - - M1 m1; - M2 m2; }; -#endif // !defined(ENDGAME_H_INCLUDED) +#endif // #ifndef ENDGAME_H_INCLUDED