X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fendgame.h;h=453d8b29d47d98780fb8a04bb00da8efed95ff8c;hp=a9634738bee0232c5c03117d62a21688a1a465cf;hb=f7d8ea3866c26df10617e97513e906d1f5a5b833;hpb=3b67636f0ecb2ec7e61e9f4adf02a7d4cae89f0a diff --git a/src/endgame.h b/src/endgame.h index a9634738..453d8b29 100644 --- a/src/endgame.h +++ b/src/endgame.h @@ -1,7 +1,7 @@ /* 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 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 +17,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,79 +36,85 @@ 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 + 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 }; +/// Endgame functions can be of two types depending on whether they return a +/// Value or a ScaleFactor. +template +using eg_fun = std::conditional<(E < SCALING_FUNCTIONS), Value, ScaleFactor>; + + /// Base and derived templates for endgame evaluation and scaling functions template struct EndgameBase { - typedef EndgameBase Base; - virtual ~EndgameBase() {} - virtual Color color() const = 0; - virtual T apply(const Position&) const = 0; + virtual Color strong_side() const = 0; + virtual T operator()(const Position&) const = 0; }; -template +template::type> 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; + const 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(). -struct Endgames { +class Endgames { - template - struct EMap { typedef std::map*> type; }; + template using Map = std::map>; - Endgames(); - ~Endgames(); - template EndgameBase* get(Key key) const; + template::type>> + void add(const std::string& code); -private: - template void add(const std::string& keyCode); + template>::value> + Map& map() { return std::get(maps); } - // Here we store two maps, for evaluate and scaling functions... - std::pair::type, EMap::type> maps; + std::pair>, Map>> maps; + +public: + Endgames(); - // ...and here is the accessing template function - template const typename EMap::type& map() const; + template> E* probe(Key key) + { return map().count(key) ? map()[key].get() : nullptr; } }; -#endif // !defined(ENDGAME_H_INCLUDED) +#endif // #ifndef ENDGAME_H_INCLUDED