X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fucioption.cpp;h=be5a1df53d8782189f4ee27c1bac23947377e10f;hp=d700e6d18e840aef53f2abf888fe98baf843ce42;hb=b58ecb85c73e31e3fec5d1ea983642864038a5b3;hpb=6c64f68ccf18a4ee1d4429abbef5fb4c0e216504 diff --git a/src/ucioption.cpp b/src/ucioption.cpp index d700e6d1..be5a1df5 100644 --- a/src/ucioption.cpp +++ b/src/ucioption.cpp @@ -1,13 +1,14 @@ /* - Glaurung, a UCI chess playing engine. - Copyright (C) 2004-2008 Tord Romstad + 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 - Glaurung is free software: you can redistribute it and/or modify + Stockfish is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. - Glaurung is distributed in the hope that it will be useful, + Stockfish is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. @@ -21,6 +22,7 @@ //// Includes //// +#include #include #include #include @@ -31,13 +33,7 @@ #include "thread.h" #include "ucioption.h" - -//// -//// Variables -//// - -bool Chess960 = false; - +using std::string; //// //// Local definitions @@ -49,110 +45,131 @@ namespace { /// Types /// - enum OptionType { SPIN, COMBO, CHECK, STRING, BUTTON, OPTION_TYPE_NONE }; + enum OptionType { SPIN, COMBO, CHECK, STRING, BUTTON }; - typedef std::vector ComboValues; + typedef std::vector ComboValues; - struct OptionValue - { - std::string defaultValue, currentValue; + struct Option { + + string name, defaultValue, currentValue; OptionType type; + size_t idx; int minValue, maxValue; ComboValues comboValues; - // Helper to convert a bool or an int in a std::string - template std::string stringify(const T& v); + Option(); + Option(const char* defaultValue, OptionType = STRING); + Option(bool defaultValue, OptionType = CHECK); + Option(int defaultValue, int minValue, int maxValue); - OptionValue(); // this is needed to use a std::map - OptionValue(const char* defaultValue, OptionType = STRING); - OptionValue(bool defaultValue); - OptionValue(int defaultValue, int minValue, int maxValue); + bool operator<(const Option& o) const { return this->idx < o.idx; } }; - typedef std::map Options; + typedef std::map Options; /// /// Constants /// - // load-defaults populates the options map with the hard - // coded options names and their default values. - void load_defaults(Options& options) { - - options["Use Search Log"] = OptionValue(false); - options["Search Log Filename"] = OptionValue("SearchLog.txt"); - options["Book File"] = OptionValue("book.bin"); - options["Mobility (Middle Game)"] = OptionValue(100, 0, 200); - options["Mobility (Endgame)"] = OptionValue(100, 0, 200); - options["Pawn Structure (Middle Game)"] = OptionValue(100, 0, 200); - options["Pawn Structure (Endgame)"] = OptionValue(100, 0, 200); - options["Passed Pawns (Middle Game)"] = OptionValue(100, 0, 200); - options["Passed Pawns (Endgame)"] = OptionValue(100, 0, 200); - options["Aggressiveness"] = OptionValue(100, 0, 200); - options["Cowardice"] = OptionValue(100, 0, 200); - options["King Safety Curve"] = OptionValue("Quadratic", COMBO); - - options["King Safety Curve"].comboValues.push_back("Quadratic"); - options["King Safety Curve"].comboValues.push_back("Linear"); /*, "From File"*/ - - options["King Safety Coefficient"] = OptionValue(40, 1, 100); - options["King Safety X Intercept"] = OptionValue(0, 0, 20); - options["King Safety Max Slope"] = OptionValue(30, 10, 100); - options["King Safety Max Value"] = OptionValue(500, 100, 1000); - options["Queen Contact Check Bonus"] = OptionValue(4, 0, 8); - options["Rook Contact Check Bonus"] = OptionValue(2, 0, 4); - options["Queen Check Bonus"] = OptionValue(2, 0, 4); - options["Rook Check Bonus"] = OptionValue(1, 0, 4); - options["Bishop Check Bonus"] = OptionValue(1, 0, 4); - options["Knight Check Bonus"] = OptionValue(1, 0, 4); - options["Discovered Check Bonus"] = OptionValue(3, 0, 8); - options["Mate Threat Bonus"] = OptionValue(3, 0, 8); - - options["Check Extension (PV nodes)"] = OptionValue(2, 0, 2); - options["Check Extension (non-PV nodes)"] = OptionValue(1, 0, 2); - options["Single Reply Extension (PV nodes)"] = OptionValue(2, 0, 2); - options["Single Reply Extension (non-PV nodes)"] = OptionValue(2, 0, 2); - options["Mate Threat Extension (PV nodes)"] = OptionValue(2, 0, 2); - options["Mate Threat Extension (non-PV nodes)"] = OptionValue(0, 0, 2); - options["Pawn Push to 7th Extension (PV nodes)"] = OptionValue(1, 0, 2); - options["Pawn Push to 7th Extension (non-PV nodes)"] = OptionValue(1, 0, 2); - options["Passed Pawn Extension (PV nodes)"] = OptionValue(1, 0, 2); - options["Passed Pawn Extension (non-PV nodes)"] = OptionValue(0, 0, 2); - options["Pawn Endgame Extension (PV nodes)"] = OptionValue(2, 0, 2); - options["Pawn Endgame Extension (non-PV nodes)"] = OptionValue(2, 0, 2); - options["Full Depth Moves (PV nodes)"] = OptionValue(14, 1, 100); - options["Full Depth Moves (non-PV nodes)"] = OptionValue(3, 1, 100); - options["Threat Depth"] = OptionValue(5, 0, 100); - options["Selective Plies"] = OptionValue(7, 0, 10); - options["Futility Pruning (Main Search)"] = OptionValue(true); - options["Futility Pruning (Quiescence Search)"] = OptionValue(true); - options["Futility Margin 0"] = OptionValue(50, 0, 1000); - options["Futility Margin 1"] = OptionValue(100, 0, 1000); - options["Futility Margin 2"] = OptionValue(300, 0, 1000); - options["Maximum Razoring Depth"] = OptionValue(3, 0, 4); - options["Razoring Margin"] = OptionValue(300, 150, 600); - options["Randomness"] = OptionValue(0, 0, 10); - options["Minimum Split Depth"] = OptionValue(4, 4, 7); - options["Maximum Number of Threads per Split Point"] = OptionValue(5, 4, 8); - options["Threads"] = OptionValue(1, 1, 8); - options["Hash"] = OptionValue(32, 4, 4096); - options["Clear Hash"] = OptionValue(false); - options["Ponder"] = OptionValue(true); - options["OwnBook"] = OptionValue(true); - options["MultiPV"] = OptionValue(1, 1, 500); - options["UCI_ShowCurrLine"] = OptionValue(false); - options["UCI_Chess960"] = OptionValue(false); + // 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 Reply Extension (PV nodes)"] = Option(2, 0, 2); + o["Single Reply 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["Full Depth Moves (PV nodes)"] = Option(14, 1, 100); + o["Full Depth Moves (non-PV nodes)"] = Option(3, 1, 100); + o["Threat Depth"] = Option(5, 0, 100); + o["LSN filtering"] = Option(true); + o["LSN Time Margin (sec)"] = Option(4, 1, 10); + o["LSN Value Margin"] = Option(200, 100, 600); + 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, 8); + o["Hash"] = Option(32, 4, 4096); + o["Clear Hash"] = 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); + + // 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 /// Options options; - // Local functions - template T get_option_value(const std::string& optionName); + // 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(); + } + + + // 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. + + template + T get_option_value(const string& optionName) { + + T ret = T(); + if (options.find(optionName) == options.end()) + return ret; + + std::istringstream ss(options[optionName].currentValue); + ss >> ret; + return ret; + } } @@ -173,19 +190,18 @@ void init_uci_options() { // with 8 threads. This is weird, but it is probably difficult to find out // why before I have a 8-core computer to experiment with myself. assert(options.find("Threads") != options.end()); + assert(options.find("Minimum Split Depth") != options.end()); - options["Threads"].defaultValue = Min(cpu_count(), 7); - options["Threads"].currentValue = Min(cpu_count(), 7); + options["Threads"].defaultValue = stringify(Min(cpu_count(), 7)); + options["Threads"].currentValue = stringify(Min(cpu_count(), 7)); // Increase the minimum split depth when the number of CPUs is big. // It would probably be better to let this depend on the number of threads // instead. - if(cpu_count() > 4) + if (cpu_count() > 4) { - assert(options.find("Minimum Split Depth") != options.end()); - - options["Minimum Split Depth"].defaultValue = 6; - options["Minimum Split Depth"].currentValue = 6; + options["Minimum Split Depth"].defaultValue = "6"; + options["Minimum Split Depth"].currentValue = "6"; } } @@ -199,33 +215,42 @@ void print_uci_options() { "spin", "combo", "check", "string", "button" }; - for (Options::iterator it = options.begin(); it != options.end(); ++it) - { - const OptionValue& o = it->second; - - std::cout << "option name " << it->first - << " type " << optionTypeName[o.type]; + // 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