X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmaterial.cpp;h=7369bca9e3c42762f778a2a75292b0c7744efd50;hp=31550720c05a48de8c0f764dd56860a9d4afc501;hb=6482ce2bb2cb2c2450008afb58c7ef2e04d56841;hpb=08c464c690e62b874b7d9b34dfabf455820153d6 diff --git a/src/material.cpp b/src/material.cpp index 31550720..7369bca9 100644 --- a/src/material.cpp +++ b/src/material.cpp @@ -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-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 @@ -19,7 +19,7 @@ #include #include -#include +#include #include "material.h" @@ -32,7 +32,7 @@ namespace { const Value EndgameLimit = Value(3998); // Scale factors used when one side has no more pawns - const uint8_t NoPawnsSF[4] = { 6, 12, 32 }; + const int NoPawnsSF[4] = { 6, 12, 32 }; // Polynomial material balance parameters const Value RedundantQueenPenalty = Value(320); @@ -48,19 +48,15 @@ namespace { { 41, 41, 41, 41, 41, 41 }, { 37, 41, 41, 41, 41, 41 }, { 10, 62, 41, 41, 41, 41 }, { 57, 64, 39, 41, 41, 41 }, { 50, 40, 23, -22, 41, 41 }, { 106, 101, 3, 151, 171, 41 } }; - typedef EndgameEvaluationFunctionBase EF; - typedef EndgameScalingFunctionBase SF; - typedef map EFMap; - typedef map SFMap; - // Endgame evaluation and scaling functions accessed direcly and not through // the function maps because correspond to more then one material hash key. - EvaluationFunction EvaluateKmmKm[] = { EvaluationFunction(WHITE), EvaluationFunction(BLACK) }; - EvaluationFunction EvaluateKXK[] = { EvaluationFunction(WHITE), EvaluationFunction(BLACK) }; - ScalingFunction ScaleKBPsK[] = { ScalingFunction(WHITE), ScalingFunction(BLACK) }; - ScalingFunction ScaleKQKRPs[] = { ScalingFunction(WHITE), ScalingFunction(BLACK) }; - ScalingFunction ScaleKPsK[] = { ScalingFunction(WHITE), ScalingFunction(BLACK) }; - ScalingFunction ScaleKPKP[] = { ScalingFunction(WHITE), ScalingFunction(BLACK) }; + Endgame EvaluateKmmKm[] = { Endgame(WHITE), Endgame(BLACK) }; + Endgame EvaluateKXK[] = { Endgame(WHITE), Endgame(BLACK) }; + + Endgame ScaleKBPsK[] = { Endgame(WHITE), Endgame(BLACK) }; + Endgame ScaleKQKRPs[] = { Endgame(WHITE), Endgame(BLACK) }; + Endgame ScaleKPsK[] = { Endgame(WHITE), Endgame(BLACK) }; + Endgame ScaleKPKP[] = { Endgame(WHITE), Endgame(BLACK) }; // Helper templates used to detect a given material distribution template bool is_KXK(const Position& pos) { @@ -84,55 +80,26 @@ namespace { && pos.piece_count(Them, ROOK) == 1 && pos.piece_count(Them, PAWN) >= 1; } -} - - -/// EndgameFunctions class stores endgame evaluation and scaling functions -/// in two std::map. Because STL library is not guaranteed to be thread -/// safe even for read access, the maps, although with identical content, -/// are replicated for each thread. This is faster then using locks. - -class EndgameFunctions { -public: - EndgameFunctions(); - ~EndgameFunctions(); - template T* get(Key key) const; - -private: - template void add(const string& keyCode); - - static Key buildKey(const string& keyCode); - static const string swapColors(const string& keyCode); - - // Here we store two maps, for evaluate and scaling functions... - pair maps; - - // ...and here is the accessing template function - template const map& get() const; -}; -// Explicit specializations of a member function shall be declared in -// the namespace of which the class template is a member. -template<> const EFMap& EndgameFunctions::get() const { return maps.first; } -template<> const SFMap& EndgameFunctions::get() const { return maps.second; } +} // namespace -/// MaterialInfoTable c'tor and d'tor allocate and free the space for EndgameFunctions +/// MaterialInfoTable c'tor and d'tor allocate and free the space for Endgames -MaterialInfoTable::MaterialInfoTable() { funcs = new EndgameFunctions(); } +void MaterialInfoTable::init() { Base::init(); if (!funcs) funcs = new Endgames(); } MaterialInfoTable::~MaterialInfoTable() { delete funcs; } -/// MaterialInfoTable::get_material_info() takes a position object as input, +/// MaterialInfoTable::material_info() takes a position object as input, /// computes or looks up a MaterialInfo object, and returns a pointer to it. /// If the material configuration is not already present in the table, it /// is stored there, so we don't have to recompute everything when the /// same material configuration occurs again. -MaterialInfo* MaterialInfoTable::get_material_info(const Position& pos) const { +MaterialInfo* MaterialInfoTable::material_info(const Position& pos) const { - Key key = pos.get_material_key(); - MaterialInfo* mi = find(key); + Key key = pos.material_key(); + MaterialInfo* mi = probe(key); // If mi->key matches the position's material hash key, it means that we // have analysed this material configuration before, and we can simply @@ -151,7 +118,7 @@ MaterialInfo* MaterialInfoTable::get_material_info(const Position& pos) const { // Let's look if we have a specialized evaluation function for this // particular material configuration. First we look for a fixed // configuration one, then a generic one if previous search failed. - if ((mi->evaluationFunction = funcs->get(key)) != NULL) + if ((mi->evaluationFunction = funcs->get(key)) != NULL) return mi; if (is_KXK(pos)) @@ -176,7 +143,7 @@ MaterialInfo* MaterialInfoTable::get_material_info(const Position& pos) const { if ( pos.piece_count(WHITE, BISHOP) + pos.piece_count(WHITE, KNIGHT) <= 2 && pos.piece_count(BLACK, BISHOP) + pos.piece_count(BLACK, KNIGHT) <= 2) { - mi->evaluationFunction = &EvaluateKmmKm[WHITE]; + mi->evaluationFunction = &EvaluateKmmKm[pos.side_to_move()]; return mi; } } @@ -186,9 +153,9 @@ MaterialInfo* MaterialInfoTable::get_material_info(const Position& pos) const { // // We face problems when there are several conflicting applicable // scaling functions and we need to decide which one to use. - SF* sf; + EndgameBase* sf; - if ((sf = funcs->get(key)) != NULL) + if ((sf = funcs->get(key)) != NULL) { mi->scalingFunction[sf->color()] = sf; return mi; @@ -236,14 +203,14 @@ MaterialInfo* MaterialInfoTable::get_material_info(const Position& pos) const { // No pawns makes it difficult to win, even with a material advantage if (pos.piece_count(WHITE, PAWN) == 0 && npm_w - npm_b <= BishopValueMidgame) { - mi->factor[WHITE] = - (npm_w == npm_b || npm_w < RookValueMidgame ? 0 : NoPawnsSF[Min(pos.piece_count(WHITE, BISHOP), 2)]); + mi->factor[WHITE] = (uint8_t) + (npm_w == npm_b || npm_w < RookValueMidgame ? 0 : NoPawnsSF[std::min(pos.piece_count(WHITE, BISHOP), 2)]); } if (pos.piece_count(BLACK, PAWN) == 0 && npm_b - npm_w <= BishopValueMidgame) { - mi->factor[BLACK] = - (npm_w == npm_b || npm_b < RookValueMidgame ? 0 : NoPawnsSF[Min(pos.piece_count(BLACK, BISHOP), 2)]); + mi->factor[BLACK] = (uint8_t) + (npm_w == npm_b || npm_b < RookValueMidgame ? 0 : NoPawnsSF[std::min(pos.piece_count(BLACK, BISHOP), 2)]); } // Compute the space weight @@ -264,7 +231,7 @@ MaterialInfo* MaterialInfoTable::get_material_info(const Position& pos) const { { pos.piece_count(BLACK, BISHOP) > 1, pos.piece_count(BLACK, PAWN), pos.piece_count(BLACK, KNIGHT), pos.piece_count(BLACK, BISHOP) , pos.piece_count(BLACK, ROOK), pos.piece_count(BLACK, QUEEN) } }; - mi->value = (int16_t)(imbalance(pieceCount) - imbalance(pieceCount)) / 16; + mi->value = (int16_t)((imbalance(pieceCount) - imbalance(pieceCount)) / 16); return mi; } @@ -277,7 +244,7 @@ int MaterialInfoTable::imbalance(const int pieceCount[][8]) { const Color Them = (Us == WHITE ? BLACK : WHITE); - int pt1, pt2, pc, vv; + int pt1, pt2, pc, v; int value = 0; // Redundancy of major pieces, formula based on Kaufman's paper @@ -287,19 +254,19 @@ int MaterialInfoTable::imbalance(const int pieceCount[][8]) { + RedundantQueenPenalty * pieceCount[Us][QUEEN]; // Second-degree polynomial material imbalance by Tord Romstad - for (pt1 = PIECE_TYPE_NONE; pt1 <= QUEEN; pt1++) + for (pt1 = NO_PIECE_TYPE; pt1 <= QUEEN; pt1++) { pc = pieceCount[Us][pt1]; if (!pc) continue; - vv = LinearCoefficients[pt1]; + v = LinearCoefficients[pt1]; - for (pt2 = PIECE_TYPE_NONE; pt2 <= pt1; pt2++) - vv += QuadraticCoefficientsSameColor[pt1][pt2] * pieceCount[Us][pt2] - + QuadraticCoefficientsOppositeColor[pt1][pt2] * pieceCount[Them][pt2]; + for (pt2 = NO_PIECE_TYPE; pt2 <= pt1; pt2++) + v += QuadraticCoefficientsSameColor[pt1][pt2] * pieceCount[Us][pt2] + + QuadraticCoefficientsOppositeColor[pt1][pt2] * pieceCount[Them][pt2]; - value += pc * vv; + value += pc * v; } return value; } @@ -313,88 +280,7 @@ Phase MaterialInfoTable::game_phase(const Position& pos) { Value npm = pos.non_pawn_material(WHITE) + pos.non_pawn_material(BLACK); - if (npm >= MidgameLimit) - return PHASE_MIDGAME; - - if (npm <= EndgameLimit) - return PHASE_ENDGAME; - - return Phase(((npm - EndgameLimit) * 128) / (MidgameLimit - EndgameLimit)); -} - - -/// EndgameFunctions member definitions - -EndgameFunctions::EndgameFunctions() { - - add >("KNNK"); - add >("KPK"); - add >("KBNK"); - add >("KRKP"); - add >("KRKB"); - add >("KRKN"); - add >("KQKR"); - add >("KBBKN"); - - add >("KNPK"); - add >("KRPKR"); - add >("KBPKB"); - add >("KBPPKB"); - add >("KBPKN"); - add >("KRPPKRP"); -} - -EndgameFunctions::~EndgameFunctions() { - - for (EFMap::const_iterator it = maps.first.begin(); it != maps.first.end(); ++it) - delete it->second; - - for (SFMap::const_iterator it = maps.second.begin(); it != maps.second.end(); ++it) - delete it->second; -} - -Key EndgameFunctions::buildKey(const string& keyCode) { - - assert(keyCode.length() > 0 && keyCode.length() < 8); - assert(keyCode[0] == 'K'); - - string fen; - bool upcase = false; - - // Build up a fen string with the given pieces, note that - // the fen string could be of an illegal position. - for (size_t i = 0; i < keyCode.length(); i++) - { - if (keyCode[i] == 'K') - upcase = !upcase; - - fen += char(upcase ? toupper(keyCode[i]) : tolower(keyCode[i])); - } - fen += char(8 - keyCode.length() + '0'); - fen += "/8/8/8/8/8/8/8 w - -"; - return Position(fen, false, 0).get_material_key(); -} - -const string EndgameFunctions::swapColors(const string& keyCode) { - - // Build corresponding key for the opposite color: "KBPKN" -> "KNKBP" - size_t idx = keyCode.find('K', 1); - return keyCode.substr(idx) + keyCode.substr(0, idx); -} - -template -void EndgameFunctions::add(const string& keyCode) { - - typedef typename T::Base F; - typedef map M; - - const_cast(get()).insert(pair(buildKey(keyCode), new T(WHITE))); - const_cast(get()).insert(pair(buildKey(swapColors(keyCode)), new T(BLACK))); -} - -template -T* EndgameFunctions::get(Key key) const { - - typename map::const_iterator it = get().find(key); - return it != get().end() ? it->second : NULL; + return npm >= MidgameLimit ? PHASE_MIDGAME + : npm <= EndgameLimit ? PHASE_ENDGAME + : Phase(((npm - EndgameLimit) * 128) / (MidgameLimit - EndgameLimit)); }