X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fucioption.cpp;h=487778e5ad590b007dde1156f9a95eef6c09b559;hp=bc35865540aa151b734b306b483d8e26a4110633;hb=9ba7f701ead00fd4a59841d457d15a15d3b84378;hpb=189a005a0be8dc255ae1e5f2d4d8c416f6b0db75 diff --git a/src/ucioption.cpp b/src/ucioption.cpp index bc358655..487778e5 100644 --- a/src/ucioption.cpp +++ b/src/ucioption.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-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 @@ -17,190 +17,97 @@ along with this program. If not, see . */ - -//// -//// Includes -//// - -#include -#include -#include -#include +#include +#include #include -#include #include "misc.h" #include "thread.h" #include "ucioption.h" using std::string; +using std::cout; +using std::endl; -//// -//// Local definitions -//// - -namespace { - - /// - /// Types - /// - - enum OptionType { SPIN, COMBO, CHECK, STRING, BUTTON }; - - typedef std::vector ComboValues; - - struct Option { - - string name, defaultValue, currentValue; - OptionType type; - size_t idx; - int minValue, maxValue; - ComboValues comboValues; - - Option(); - Option(const char* defaultValue, OptionType = STRING); - Option(bool defaultValue, OptionType = CHECK); - Option(int defaultValue, int minValue, int maxValue); - - bool operator<(const Option& o) const { return this->idx < o.idx; } - }; - - typedef std::map Options; - - /// - /// Constants - /// - - // load_defaults populates the options map with the hard - // coded names and default values. - - void load_defaults(Options& o) { - - o["Use Search Log"] = Option(false); - o["Search Log Filename"] = Option("SearchLog.txt"); - o["Book File"] = Option("book.bin"); - o["Mobility (Middle Game)"] = Option(100, 0, 200); - o["Mobility (Endgame)"] = Option(100, 0, 200); - o["Pawn Structure (Middle Game)"] = Option(100, 0, 200); - o["Pawn Structure (Endgame)"] = Option(100, 0, 200); - o["Passed Pawns (Middle Game)"] = Option(100, 0, 200); - o["Passed Pawns (Endgame)"] = Option(100, 0, 200); - o["Space"] = Option(100, 0, 200); - o["Aggressiveness"] = Option(100, 0, 200); - o["Cowardice"] = Option(100, 0, 200); - o["King Safety Curve"] = Option("Quadratic", COMBO); - - o["King Safety Curve"].comboValues.push_back("Quadratic"); - o["King Safety Curve"].comboValues.push_back("Linear"); /*, "From File"*/ - - o["King Safety Coefficient"] = Option(40, 1, 100); - o["King Safety X Intercept"] = Option(0, 0, 20); - o["King Safety Max Slope"] = Option(30, 10, 100); - o["King Safety Max Value"] = Option(500, 100, 1000); - o["Queen Contact Check Bonus"] = Option(3, 0, 8); - o["Queen Check Bonus"] = Option(2, 0, 4); - o["Rook Check Bonus"] = Option(1, 0, 4); - o["Bishop Check Bonus"] = Option(1, 0, 4); - o["Knight Check Bonus"] = Option(1, 0, 4); - o["Discovered Check Bonus"] = Option(3, 0, 8); - o["Mate Threat Bonus"] = Option(3, 0, 8); - o["Check Extension (PV nodes)"] = Option(2, 0, 2); - o["Check Extension (non-PV nodes)"] = Option(1, 0, 2); - o["Single Evasion Extension (PV nodes)"] = Option(2, 0, 2); - o["Single Evasion Extension (non-PV nodes)"] = Option(2, 0, 2); - o["Mate Threat Extension (PV nodes)"] = Option(0, 0, 2); - o["Mate Threat Extension (non-PV nodes)"] = Option(0, 0, 2); - o["Pawn Push to 7th Extension (PV nodes)"] = Option(1, 0, 2); - o["Pawn Push to 7th Extension (non-PV nodes)"] = Option(1, 0, 2); - o["Passed Pawn Extension (PV nodes)"] = Option(1, 0, 2); - o["Passed Pawn Extension (non-PV nodes)"] = Option(0, 0, 2); - o["Pawn Endgame Extension (PV nodes)"] = Option(2, 0, 2); - o["Pawn Endgame Extension (non-PV nodes)"] = Option(2, 0, 2); - o["Threat Depth"] = Option(5, 0, 100); - o["Randomness"] = Option(0, 0, 10); - o["Minimum Split Depth"] = Option(4, 4, 7); - o["Maximum Number of Threads per Split Point"] = Option(5, 4, 8); - o["Threads"] = Option(1, 1, MAX_THREADS); - o["Hash"] = Option(32, 4, 8192); - o["Clear Hash"] = Option(false, BUTTON); - o["New Game"] = Option(false, BUTTON); - o["Ponder"] = Option(true); - o["OwnBook"] = Option(true); - o["MultiPV"] = Option(1, 1, 500); - o["UCI_ShowCurrLine"] = Option(false); - o["UCI_Chess960"] = Option(false); - o["UCI_AnalyseMode"] = Option(false); - - // Any option should know its name so to be easily printed - for (Options::iterator it = o.begin(); it != o.end(); ++it) - it->second.name = it->first; - } - - /// - /// Variables - /// +OptionsMap Options; // Global object - Options options; - - // stringify converts a value of type T to a std::string - template - string stringify(const T& v) { - - std::ostringstream ss; - ss << v; - return ss.str(); - } +// Our case insensitive less() function as required by UCI protocol +bool CaseInsensitiveLess::operator() (const string& s1, const string& s2) const { - // get_option_value implements the various get_option_value_ - // functions defined later, because only the option value - // type changes a template seems a proper solution. + int c1, c2; + size_t i = 0; - template - T get_option_value(const string& optionName) { - - T ret = T(); - if (options.find(optionName) == options.end()) - return ret; + while (i < s1.size() && i < s2.size()) + { + c1 = tolower(s1[i]); + c2 = tolower(s2[i++]); - std::istringstream ss(options[optionName].currentValue); - ss >> ret; - return ret; + if (c1 != c2) + return c1 < c2; } + return s1.size() < s2.size(); +} - // Specialization for std::string where instruction 'ss >> ret;' - // would erroneusly tokenize a string with spaces. - - template<> - string get_option_value(const string& optionName) { - - if (options.find(optionName) == options.end()) - return string(); - return options[optionName].currentValue; - } +// stringify() converts a numeric value of type T to a std::string +template +static string stringify(const T& v) { + std::ostringstream ss; + ss << v; + return ss.str(); } -//// -//// Functions -//// -/// init_uci_options() initializes the UCI options. Currently, the only -/// thing this function does is to initialize the default value of the -/// "Threads" parameter to the number of available CPU cores. +/// init_uci_options() initializes the UCI options to their hard coded default +/// values and initializes the default value of "Threads" and "Minimum Split Depth" +/// parameters according to the number of CPU cores. void init_uci_options() { - load_defaults(options); - - // Set optimal value for parameter "Minimum Split Depth" - // according to number of available cores. - assert(options.find("Threads") != options.end()); - assert(options.find("Minimum Split Depth") != options.end()); - - Option& thr = options["Threads"]; - Option& msd = options["Minimum Split Depth"]; + Options["Use Search Log"] = Option(false); + Options["Search Log Filename"] = Option("SearchLog.txt"); + Options["Book File"] = Option("book.bin"); + Options["Best Book Move"] = Option(false); + Options["Mobility (Middle Game)"] = Option(100, 0, 200); + Options["Mobility (Endgame)"] = Option(100, 0, 200); + Options["Pawn Structure (Middle Game)"] = Option(100, 0, 200); + Options["Pawn Structure (Endgame)"] = Option(100, 0, 200); + Options["Passed Pawns (Middle Game)"] = Option(100, 0, 200); + Options["Passed Pawns (Endgame)"] = Option(100, 0, 200); + Options["Space"] = Option(100, 0, 200); + Options["Aggressiveness"] = Option(100, 0, 200); + Options["Cowardice"] = Option(100, 0, 200); + Options["Check Extension (PV nodes)"] = Option(2, 0, 2); + Options["Check Extension (non-PV nodes)"] = Option(1, 0, 2); + Options["Mate Threat Extension (PV nodes)"] = Option(2, 0, 2); + Options["Mate Threat Extension (non-PV nodes)"] = Option(2, 0, 2); + Options["Pawn Push to 7th Extension (PV nodes)"] = Option(1, 0, 2); + Options["Pawn Push to 7th Extension (non-PV nodes)"] = Option(1, 0, 2); + Options["Passed Pawn Extension (PV nodes)"] = Option(1, 0, 2); + Options["Passed Pawn Extension (non-PV nodes)"] = Option(0, 0, 2); + Options["Pawn Endgame Extension (PV nodes)"] = Option(2, 0, 2); + Options["Pawn Endgame Extension (non-PV nodes)"] = Option(2, 0, 2); + Options["Minimum Split Depth"] = Option(4, 4, 7); + Options["Maximum Number of Threads per Split Point"] = Option(5, 4, 8); + Options["Threads"] = Option(1, 1, MAX_THREADS); + Options["Use Sleeping Threads"] = Option(true); + Options["Hash"] = Option(32, 4, 8192); + Options["Clear Hash"] = Option(false, "button"); + Options["Ponder"] = Option(true); + Options["OwnBook"] = Option(true); + Options["MultiPV"] = Option(1, 1, 500); + Options["Emergency Move Horizon"] = Option(40, 0, 50); + Options["Emergency Base Time"] = Option(200, 0, 30000); + Options["Emergency Move Time"] = Option(70, 0, 5000); + Options["Minimum Thinking Time"] = Option(20, 0, 5000); + Options["UCI_Chess960"] = Option(false); + Options["UCI_AnalyseMode"] = Option(false); + + // Set some SMP parameters accordingly to the detected CPU count + Option& thr = Options["Threads"]; + Option& msd = Options["Minimum Split Depth"]; thr.defaultValue = thr.currentValue = stringify(cpu_count()); @@ -209,151 +116,65 @@ void init_uci_options() { } -/// print_uci_options() prints all the UCI options to the standard output, -/// in the format defined by the UCI protocol. - -void print_uci_options() { +/// options_to_uci() returns a string with all the UCI options in chronological +/// insertion order (the idx field) and in the format defined by the UCI protocol. - static const char optionTypeName[][16] = { - "spin", "combo", "check", "string", "button" - }; +string options_to_uci() { - // Build up a vector out of the options map and sort it according to idx - // field, that is the chronological insertion order in options map. - std::vector