mirror of
https://github.com/sockspls/badfish
synced 2025-04-30 08:43:09 +00:00
209 lines
7.2 KiB
C++
209 lines
7.2 KiB
C++
/*
|
||
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
|
||
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
|
||
Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
|
||
Copyright (C) 2015-2020 Marco Costalba, Joona Kiiski, Gary Linscott, 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
|
||
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/>.
|
||
*/
|
||
|
||
#include <algorithm>
|
||
#include <cassert>
|
||
#include <ostream>
|
||
#include <sstream>
|
||
|
||
#include "misc.h"
|
||
#include "search.h"
|
||
#include "thread.h"
|
||
#include "tt.h"
|
||
#include "uci.h"
|
||
#include "syzygy/tbprobe.h"
|
||
|
||
using std::string;
|
||
|
||
UCI::OptionsMap Options; // Global object
|
||
|
||
namespace UCI {
|
||
|
||
/// 'On change' actions, triggered by an option's value change
|
||
void on_clear_hash(const Option&) { Search::clear(); }
|
||
void on_hash_size(const Option& o) { TT.resize(size_t(o)); }
|
||
void on_logger(const Option& o) { start_logger(o); }
|
||
void on_threads(const Option& o) { Threads.set(size_t(o)); }
|
||
void on_tb_path(const Option& o) { Tablebases::init(o); }
|
||
void on_eval_dir(const Option& o) { load_eval_finished = false; }
|
||
|
||
|
||
/// Our case insensitive less() function as required by UCI protocol
|
||
bool CaseInsensitiveLess::operator() (const string& s1, const string& s2) const {
|
||
|
||
return std::lexicographical_compare(s1.begin(), s1.end(), s2.begin(), s2.end(),
|
||
[](char c1, char c2) { return tolower(c1) < tolower(c2); });
|
||
}
|
||
|
||
|
||
/// UCI::init() initializes the UCI options to their hard-coded default values
|
||
|
||
void init(OptionsMap& o) {
|
||
|
||
constexpr int MaxHashMB = Is64Bit ? 33554432 : 2048;
|
||
|
||
o["Debug Log File"] << Option("", on_logger);
|
||
o["Contempt"] << Option(24, -100, 100);
|
||
o["Analysis Contempt"] << Option("Both var Off var White var Black var Both", "Both");
|
||
o["Threads"] << Option(1, 1, 512, on_threads);
|
||
o["Hash"] << Option(16, 1, MaxHashMB, on_hash_size);
|
||
o["Clear Hash"] << Option(on_clear_hash);
|
||
o["Ponder"] << Option(false);
|
||
o["MultiPV"] << Option(1, 1, 500);
|
||
o["Skill Level"] << Option(20, 0, 20);
|
||
o["Move Overhead"] << Option(10, 0, 5000);
|
||
o["Slow Mover"] << Option(100, 10, 1000);
|
||
o["nodestime"] << Option(0, 0, 10000);
|
||
o["UCI_Chess960"] << Option(false);
|
||
o["UCI_AnalyseMode"] << Option(false);
|
||
o["UCI_LimitStrength"] << Option(false);
|
||
o["UCI_Elo"] << Option(1350, 1350, 2850);
|
||
o["SyzygyPath"] << Option("<empty>", on_tb_path);
|
||
o["SyzygyProbeDepth"] << Option(1, 1, 100);
|
||
o["Syzygy50MoveRule"] << Option(true);
|
||
o["SyzygyProbeLimit"] << Option(7, 0, 7);
|
||
// <20>]<5D><><EFBFBD><EFBFBD><D690>t<EFBFBD>H<EFBFBD><48><EFBFBD>_<EFBFBD>B<EFBFBD><42><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ύX<CF8D><58><EFBFBD><EFBFBD><EFBFBD>Ƃ<EFBFBD><C682>A<EFBFBD>]<5D><><EFBFBD><EFBFBD><D690><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>isready<64>^<5E>C<EFBFBD>~<7E><><EFBFBD>O<EFBFBD>œǂݒ<C782><DD92><EFBFBD><EFBFBD>K<EFBFBD>v<EFBFBD><76><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>B
|
||
o["EvalDir"] << Option("eval", on_eval_dir);
|
||
// isready<64>^<5E>C<EFBFBD>~<7E><><EFBFBD>O<EFBFBD>ŕ]<5D><><EFBFBD><EFBFBD><D690><EFBFBD><EFBFBD>ǂݍ<C782><DD8D>܂<EFBFBD><DC82><EFBFBD><EFBFBD>ƁA<C681>V<EFBFBD><56><EFBFBD><EFBFBD><EFBFBD>]<5D><><EFBFBD><EFBFBD><D690>̕ϊ<CC95><CF8A>̂<EFBFBD><CC82>߂<EFBFBD>
|
||
// test evalconvert<72>R<EFBFBD>}<7D><><EFBFBD>h<EFBFBD><68><EFBFBD>@<40><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂ɁA<C981><41><EFBFBD>̐V<CC90><56><EFBFBD><EFBFBD><EFBFBD>]<5D><><EFBFBD><EFBFBD><D690><EFBFBD><EFBFBD>Ȃ<EFBFBD><C882><EFBFBD><EFBFBD><EFBFBD><EFBFBD>߂<EFBFBD>
|
||
// <20><><EFBFBD>̃R<CC83>}<7D><><EFBFBD>h<EFBFBD>̎<EFBFBD><CC8E>s<EFBFBD>O<EFBFBD>Ɉُ<C988><D98F>I<EFBFBD><49><EFBFBD><EFBFBD><EFBFBD>Ă<EFBFBD><C482>܂<EFBFBD><DC82>B
|
||
// <20><><EFBFBD><EFBFBD><EFBFBD>ł<EFBFBD><C582>̉B<CC89><42><EFBFBD>I<EFBFBD>v<EFBFBD>V<EFBFBD><56><EFBFBD><EFBFBD><EFBFBD><EFBFBD>isready<64><79><EFBFBD>̕]<5D><><EFBFBD><EFBFBD><D690>̓ǂݍ<C782><DD8D>݂<EFBFBD><DD82>}<7D><><EFBFBD><EFBFBD><EFBFBD>āA
|
||
// test evalconvert<72>R<EFBFBD>}<7D><><EFBFBD>h<EFBFBD><68><EFBFBD>@<40><><EFBFBD>B
|
||
o["SkipLoadingEval"] << Option(false);
|
||
// <20><><EFBFBD>Ղ̎w<CC8E><77><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڂ܂ŗp<C597><70><EFBFBD>邩
|
||
o["BookMoves"] << Option(16, 0, 10000);
|
||
|
||
#if defined(EVAL_LEARN)
|
||
// <20>]<5D><><EFBFBD><EFBFBD><D690>̊w<CC8A>K<EFBFBD><4B><EFBFBD>s<EFBFBD>Ȃ<EFBFBD><C882>Ƃ<EFBFBD><C682>́A<CD81>]<5D><><EFBFBD><EFBFBD><D690>̕ۑ<CC95><DB91><EFBFBD><EFBFBD>̃t<CC83>H<EFBFBD><48><EFBFBD>_<EFBFBD><5F><EFBFBD>ύX<CF8D>ł<EFBFBD><C582><EFBFBD><EFBFBD>B
|
||
// <20>f<EFBFBD>t<EFBFBD>H<EFBFBD><48><EFBFBD>g<EFBFBD>ł<EFBFBD>evalsave<76>B<EFBFBD><42><EFBFBD>̃t<CC83>H<EFBFBD><48><EFBFBD>_<EFBFBD>͎<EFBFBD><CD8E>O<EFBFBD>ɗp<C997>ӂ<EFBFBD><D382><EFBFBD><EFBFBD>Ă<EFBFBD><C482><EFBFBD><EFBFBD><EFBFBD><EFBFBD>̂Ƃ<CC82><C682><EFBFBD><EFBFBD>B
|
||
// <20><><EFBFBD>̃t<CC83>H<EFBFBD><48><EFBFBD>_<EFBFBD>z<EFBFBD><7A><EFBFBD>Ƀt<C983>H<EFBFBD><48><EFBFBD>_<EFBFBD><5F>"0/","1/",<2C>c<EFBFBD>̂悤<CC82>Ɏ<EFBFBD><C98E><EFBFBD><EFBFBD>I<EFBFBD>Ɍ@<40><><EFBFBD>A<EFBFBD><41><EFBFBD><EFBFBD><EFBFBD>ɕ]<5D><><EFBFBD><EFBFBD><D690>t<EFBFBD>@<40>C<EFBFBD><43><EFBFBD><EFBFBD><EFBFBD>ۑ<EFBFBD><DB91><EFBFBD><EFBFBD><EFBFBD><EFBFBD>B
|
||
o["EvalSaveDir"] << Option("evalsave");
|
||
#endif
|
||
}
|
||
|
||
|
||
/// operator<<() is used to print all the options default values 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) {
|
||
|
||
for (size_t idx = 0; idx < om.size(); ++idx)
|
||
for (const auto& it : om)
|
||
if (it.second.idx == idx)
|
||
{
|
||
const Option& o = it.second;
|
||
os << "\noption name " << it.first << " type " << o.type;
|
||
|
||
if (o.type == "string" || o.type == "check" || o.type == "combo")
|
||
os << " default " << o.defaultValue;
|
||
|
||
if (o.type == "spin")
|
||
os << " default " << int(stof(o.defaultValue))
|
||
<< " min " << o.min
|
||
<< " max " << o.max;
|
||
|
||
break;
|
||
}
|
||
|
||
return os;
|
||
}
|
||
|
||
|
||
/// Option class constructors and conversion operators
|
||
|
||
Option::Option(const char* v, OnChange f) : type("string"), min(0), max(0), on_change(f)
|
||
{ defaultValue = currentValue = v; }
|
||
|
||
Option::Option(bool v, OnChange f) : type("check"), min(0), max(0), on_change(f)
|
||
{ defaultValue = currentValue = (v ? "true" : "false"); }
|
||
|
||
Option::Option(OnChange f) : type("button"), min(0), max(0), on_change(f)
|
||
{}
|
||
|
||
Option::Option(double v, int minv, int maxv, OnChange f) : type("spin"), min(minv), max(maxv), on_change(f)
|
||
{ defaultValue = currentValue = std::to_string(v); }
|
||
|
||
Option::Option(const char* v, const char* cur, OnChange f) : type("combo"), min(0), max(0), on_change(f)
|
||
{ defaultValue = v; currentValue = cur; }
|
||
|
||
Option::operator double() const {
|
||
assert(type == "check" || type == "spin");
|
||
return (type == "spin" ? stof(currentValue) : currentValue == "true");
|
||
}
|
||
|
||
Option::operator std::string() const {
|
||
assert(type == "string");
|
||
return currentValue;
|
||
}
|
||
|
||
bool Option::operator==(const char* s) const {
|
||
assert(type == "combo");
|
||
return !CaseInsensitiveLess()(currentValue, s)
|
||
&& !CaseInsensitiveLess()(s, currentValue);
|
||
}
|
||
|
||
|
||
/// 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.
|
||
|
||
Option& Option::operator=(const string& v) {
|
||
|
||
assert(!type.empty());
|
||
|
||
if ( (type != "button" && v.empty())
|
||
|| (type == "check" && v != "true" && v != "false")
|
||
|| (type == "spin" && (stof(v) < min || stof(v) > max)))
|
||
return *this;
|
||
|
||
if (type == "combo")
|
||
{
|
||
OptionsMap comboMap; // To have case insensitive compare
|
||
string token;
|
||
std::istringstream ss(defaultValue);
|
||
while (ss >> token)
|
||
comboMap[token] << Option();
|
||
if (!comboMap.count(v) || v == "var")
|
||
return *this;
|
||
}
|
||
|
||
if (type != "button")
|
||
currentValue = v;
|
||
|
||
if (on_change)
|
||
on_change(*this);
|
||
|
||
return *this;
|
||
}
|
||
|
||
// <20>]<5D><><EFBFBD><EFBFBD><D690><EFBFBD><EFBFBD>ǂݍ<C782><DD8D><EFBFBD><F182BE82>̃t<CC83><74><EFBFBD>O<EFBFBD>B<EFBFBD><42><EFBFBD><EFBFBD><EFBFBD><EFBFBD>evaldir<69>̕ύX<CF8D>ɂƂ<C982><C682>Ȃ<EFBFBD><C882><EFBFBD>false<73>ɂ<EFBFBD><C982><EFBFBD><EFBFBD>B
|
||
bool load_eval_finished = false;
|
||
} // namespace UCI
|