2011-11-12 20:44:06 +01:00
|
|
|
/*
|
|
|
|
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
|
|
|
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
|
2012-01-01 01:52:19 +01:00
|
|
|
Copyright (C) 2008-2012 Marco Costalba, Joona Kiiski, Tord Romstad
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
#include <algorithm>
|
2011-11-12 20:44:06 +01:00
|
|
|
#include <sstream>
|
|
|
|
|
|
|
|
#include "misc.h"
|
|
|
|
#include "thread.h"
|
|
|
|
#include "ucioption.h"
|
|
|
|
|
|
|
|
using std::string;
|
2012-01-15 02:13:33 +01:00
|
|
|
using namespace std;
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
OptionsMap Options; // Global object
|
|
|
|
|
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
/// Our case insensitive less() function as required by UCI protocol
|
|
|
|
static bool ci_less(char c1, char c2) { return tolower(c1) < tolower(c2); }
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
bool CaseInsensitiveLess::operator() (const string& s1, const string& s2) const {
|
2012-01-07 03:07:28 +01:00
|
|
|
return lexicographical_compare(s1.begin(), s1.end(), s2.begin(), s2.end(), ci_less);
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// OptionsMap c'tor initializes the UCI options to their hard coded default
|
2012-01-01 01:52:19 +01:00
|
|
|
/// values and initializes the default value of "Threads" and "Min Split Depth"
|
|
|
|
/// parameters according to the number of CPU cores detected.
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
OptionsMap::OptionsMap() {
|
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
int cpus = std::min(cpu_count(), MAX_THREADS);
|
|
|
|
int msd = cpus < 8 ? 4 : 7;
|
2011-11-12 20:44:06 +01:00
|
|
|
OptionsMap& o = *this;
|
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
o["Use Search Log"] = UCIOption(false);
|
|
|
|
o["Search Log Filename"] = UCIOption("SearchLog.txt");
|
|
|
|
o["Book File"] = UCIOption("book.bin");
|
|
|
|
o["Best Book Move"] = UCIOption(false);
|
|
|
|
o["Mobility (Middle Game)"] = UCIOption(100, 0, 200);
|
|
|
|
o["Mobility (Endgame)"] = UCIOption(100, 0, 200);
|
|
|
|
o["Passed Pawns (Middle Game)"] = UCIOption(100, 0, 200);
|
|
|
|
o["Passed Pawns (Endgame)"] = UCIOption(100, 0, 200);
|
|
|
|
o["Space"] = UCIOption(100, 0, 200);
|
|
|
|
o["Aggressiveness"] = UCIOption(100, 0, 200);
|
|
|
|
o["Cowardice"] = UCIOption(100, 0, 200);
|
|
|
|
o["Min Split Depth"] = UCIOption(msd, 4, 7);
|
|
|
|
o["Max Threads per Split Point"] = UCIOption(5, 4, 8);
|
|
|
|
o["Threads"] = UCIOption(cpus, 1, MAX_THREADS);
|
|
|
|
o["Use Sleeping Threads"] = UCIOption(false);
|
|
|
|
o["Hash"] = UCIOption(32, 4, 8192);
|
|
|
|
o["Clear Hash"] = UCIOption(false, "button");
|
|
|
|
o["Ponder"] = UCIOption(true);
|
|
|
|
o["OwnBook"] = UCIOption(true);
|
|
|
|
o["MultiPV"] = UCIOption(1, 1, 500);
|
|
|
|
o["Skill Level"] = UCIOption(20, 0, 20);
|
|
|
|
o["Emergency Move Horizon"] = UCIOption(40, 0, 50);
|
|
|
|
o["Emergency Base Time"] = UCIOption(200, 0, 30000);
|
|
|
|
o["Emergency Move Time"] = UCIOption(70, 0, 5000);
|
|
|
|
o["Minimum Thinking Time"] = UCIOption(20, 0, 5000);
|
|
|
|
o["UCI_Chess960"] = UCIOption(false);
|
|
|
|
o["UCI_AnalyseMode"] = UCIOption(false);
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
/// operator<<() is used to output all the UCI options in chronological insertion
|
|
|
|
/// order (the idx field) and in the format defined by the UCI protocol.
|
|
|
|
std::ostream& operator<<(std::ostream& os, const OptionsMap& om) {
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
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)
|
2011-11-12 20:44:06 +01:00
|
|
|
{
|
|
|
|
const UCIOption& o = it->second;
|
2012-01-01 01:52:19 +01:00
|
|
|
os << "\noption name " << it->first << " type " << o.type;
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
if (o.type != "button")
|
2012-01-01 01:52:19 +01:00
|
|
|
os << " default " << o.defaultValue;
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
if (o.type == "spin")
|
2012-01-01 01:52:19 +01:00
|
|
|
os << " min " << o.min << " max " << o.max;
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
break;
|
|
|
|
}
|
2012-01-01 01:52:19 +01:00
|
|
|
return os;
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
/// UCIOption class c'tors
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
UCIOption::UCIOption(const char* v) : type("string"), min(0), max(0), idx(Options.size())
|
|
|
|
{ defaultValue = currentValue = v; }
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
UCIOption::UCIOption(bool v, string t) : type(t), min(0), max(0), idx(Options.size())
|
|
|
|
{ defaultValue = currentValue = (v ? "true" : "false"); }
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
UCIOption::UCIOption(int v, int minv, int maxv) : type("spin"), min(minv), max(maxv), idx(Options.size())
|
|
|
|
{ std::ostringstream ss; ss << v; defaultValue = currentValue = ss.str(); }
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
/// UCIOption::operator=() updates currentValue. Normally it's up to the GUI to
|
|
|
|
/// check for option's limits, but we could receive the new value directly from
|
|
|
|
/// the user by teminal window, so let's check the bounds anyway.
|
2011-11-12 20:44:06 +01:00
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
void UCIOption::operator=(const string& v) {
|
2011-11-12 20:44:06 +01:00
|
|
|
|
|
|
|
assert(!type.empty());
|
|
|
|
|
2012-01-01 01:52:19 +01:00
|
|
|
if ( !v.empty()
|
|
|
|
&& (type == "check" || type == "button") == (v == "true" || v == "false")
|
|
|
|
&& (type != "spin" || (atoi(v.c_str()) >= min && atoi(v.c_str()) <= max)))
|
|
|
|
currentValue = v;
|
2011-11-12 20:44:06 +01:00
|
|
|
}
|