X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fucioption.cpp;h=fd6c46d2f35489beee9b4360c0c37422d3fe3131;hp=417765a54b6c3a487803df7481752cf286771876;hb=a66c73deef420104e74b6645ee60e20b37fd8549;hpb=40c863d41af5058a02f1de3423a000d801dcb08a diff --git a/src/ucioption.cpp b/src/ucioption.cpp index 417765a5..fd6c46d2 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-2014 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 @@ -19,14 +19,13 @@ #include #include -#include -#include +#include -#include "evaluate.h" #include "misc.h" #include "thread.h" #include "tt.h" -#include "ucioption.h" +#include "uci.h" +#include "syzygy/tbprobe.h" using std::string; @@ -35,18 +34,18 @@ UCI::OptionsMap Options; // Global object namespace UCI { /// 'On change' actions, triggered by an option's value change +void on_clear_hash(const Option&) { TT.clear(); } +void on_hash_size(const Option& o) { TT.resize(o); } void on_logger(const Option& o) { start_logger(o); } -void on_eval(const Option&) { Eval::init(); } void on_threads(const Option&) { Threads.read_uci_options(); } -void on_hash_size(const Option& o) { TT.set_size(o); } -void on_clear_hash(const Option&) { TT.clear(); } +void on_tb_path(const Option& o) { Tablebases::init(o); } /// Our case insensitive less() function as required by UCI protocol -bool ci_less(char c1, char c2) { return tolower(c1) < tolower(c2); } - bool CaseInsensitiveLess::operator() (const string& s1, const string& s2) const { - return std::lexicographical_compare(s1.begin(), s1.end(), s2.begin(), s2.end(), ci_less); + + return std::lexicographical_compare(s1.begin(), s1.end(), s2.begin(), s2.end(), + [](char c1, char c2) { return tolower(c1) < tolower(c2); }); } @@ -54,38 +53,26 @@ bool CaseInsensitiveLess::operator() (const string& s1, const string& s2) const void init(OptionsMap& o) { - o["Write Debug Log"] = Option(false, on_logger); - o["Write Search Log"] = Option(false); - o["Search Log Filename"] = Option("SearchLog.txt"); - o["Book File"] = Option("book.bin"); - o["Best Book Move"] = Option(false); - o["Contempt Factor"] = Option(0, -50, 50); - o["Mobility (Midgame)"] = Option(100, 0, 200, on_eval); - o["Mobility (Endgame)"] = Option(100, 0, 200, on_eval); - o["Pawn Structure (Midgame)"] = Option(100, 0, 200, on_eval); - o["Pawn Structure (Endgame)"] = Option(100, 0, 200, on_eval); - o["Passed Pawns (Midgame)"] = Option(100, 0, 200, on_eval); - o["Passed Pawns (Endgame)"] = Option(100, 0, 200, on_eval); - o["Space"] = Option(100, 0, 200, on_eval); - o["Aggressiveness"] = Option(100, 0, 200, on_eval); - o["Cowardice"] = Option(100, 0, 200, on_eval); - o["Min Split Depth"] = Option(0, 0, 12, on_threads); - o["Max Threads per Split Point"] = Option(5, 4, 8, on_threads); - o["Threads"] = Option(1, 1, MAX_THREADS, on_threads); - o["Idle Threads Sleep"] = Option(true); - o["Hash"] = Option(32, 1, 16384, on_hash_size); - o["Clear Hash"] = Option(on_clear_hash); - o["Ponder"] = Option(true); - o["OwnBook"] = Option(false); - o["MultiPV"] = Option(1, 1, 500); - o["Skill Level"] = Option(20, 0, 20); - o["Emergency Move Horizon"] = Option(40, 0, 50); - o["Emergency Base Time"] = Option(60, 0, 30000); - o["Emergency Move Time"] = Option(30, 0, 5000); - o["Minimum Thinking Time"] = Option(20, 0, 5000); - o["Slow Mover"] = Option(70, 10, 1000); - o["UCI_Chess960"] = Option(false); - o["UCI_AnalyseMode"] = Option(false, on_eval); + const int MaxHashMB = Is64Bit ? 1024 * 1024 : 2048; + + o["Write Debug Log"] << Option(false, on_logger); + o["Contempt"] << Option(0, -100, 100); + o["Min Split Depth"] << Option(0, 0, 12, on_threads); + o["Threads"] << Option(1, 1, MAX_THREADS, on_threads); + o["Hash"] << Option(16, 1, MaxHashMB, on_hash_size); + o["Clear Hash"] << Option(on_clear_hash); + o["Ponder"] << Option(true); + o["MultiPV"] << Option(1, 1, 500); + o["Skill Level"] << Option(20, 0, 20); + o["Move Overhead"] << Option(30, 0, 5000); + o["Minimum Thinking Time"] << Option(20, 0, 5000); + o["Slow Mover"] << Option(80, 10, 1000); + o["nodestime"] << Option(0, 0, 10000); + o["UCI_Chess960"] << Option(false); + o["SyzygyPath"] << Option("", on_tb_path); + o["SyzygyProbeDepth"] << Option(1, 1, 100); + o["Syzygy50MoveRule"] << Option(true); + o["SyzygyProbeLimit"] << Option(6, 0, 6); } @@ -95,11 +82,11 @@ void init(OptionsMap& o) { std::ostream& operator<<(std::ostream& os, const OptionsMap& om) { for (size_t idx = 0; idx < om.size(); ++idx) - for (OptionsMap::const_iterator it = om.begin(); it != om.end(); ++it) - if (it->second.idx == idx) + for (const auto& it : om) + if (it.second.idx == idx) { - const Option& o = it->second; - os << "\noption name " << it->first << " type " << o.type; + const Option& o = it.second; + os << "\noption name " << it.first << " type " << o.type; if (o.type != "button") os << " default " << o.defaultValue; @@ -109,28 +96,28 @@ std::ostream& operator<<(std::ostream& os, const OptionsMap& om) { break; } + return os; } /// Option class constructors and conversion operators -Option::Option(const char* v, Fn* f) : type("string"), min(0), max(0), idx(Options.size()), on_change(f) +Option::Option(const char* v, OnChange f) : type("string"), min(0), max(0), on_change(f) { defaultValue = currentValue = v; } -Option::Option(bool v, Fn* f) : type("check"), min(0), max(0), idx(Options.size()), on_change(f) +Option::Option(bool v, OnChange f) : type("check"), min(0), max(0), on_change(f) { defaultValue = currentValue = (v ? "true" : "false"); } -Option::Option(Fn* f) : type("button"), min(0), max(0), idx(Options.size()), on_change(f) +Option::Option(OnChange f) : type("button"), min(0), max(0), on_change(f) {} -Option::Option(int v, int minv, int maxv, Fn* f) : type("spin"), min(minv), max(maxv), idx(Options.size()), on_change(f) -{ std::ostringstream ss; ss << v; defaultValue = currentValue = ss.str(); } - +Option::Option(int v, int minv, int maxv, OnChange f) : type("spin"), min(minv), max(maxv), on_change(f) +{ defaultValue = currentValue = std::to_string(v); } Option::operator int() const { assert(type == "check" || type == "spin"); - return (type == "spin" ? atoi(currentValue.c_str()) : currentValue == "true"); + return (type == "spin" ? stoi(currentValue) : currentValue == "true"); } Option::operator std::string() const { @@ -139,6 +126,17 @@ Option::operator std::string() const { } +/// operator<<() inits options and assigns idx in the correct printing order + +void Option::operator<<(const Option& o) { + + static size_t insert_order = 0; + + *this = o; + idx = insert_order++; +} + + /// operator=() updates currentValue and triggers on_change() action. It's up to /// the GUI to check for option's limits, but we could receive the new value from /// the user by console window, so let's check the bounds anyway. @@ -149,14 +147,14 @@ Option& Option::operator=(const string& v) { if ( (type != "button" && v.empty()) || (type == "check" && v != "true" && v != "false") - || (type == "spin" && (atoi(v.c_str()) < min || atoi(v.c_str()) > max))) + || (type == "spin" && (stoi(v) < min || stoi(v) > max))) return *this; if (type != "button") currentValue = v; if (on_change) - (*on_change)(*this); + on_change(*this); return *this; }