X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fucioption.cpp;h=1778c7182a52f56de7209e19a79af8b90cc17feb;hp=660981cbd00c917d1b8788b5653dc19fb7de2ad0;hb=856a5f3aaaf8b9d53599963decacd4476b55c034;hpb=3c07603dac03f0da20194097cf4eb1a396fea60d

diff --git a/src/ucioption.cpp b/src/ucioption.cpp
index 660981cb..1778c718 100644
--- a/src/ucioption.cpp
+++ b/src/ucioption.cpp
@@ -19,12 +19,14 @@
 
 #include <algorithm>
 #include <cassert>
+#include <cstdlib>
 #include <sstream>
 
 #include "misc.h"
 #include "thread.h"
 #include "tt.h"
 #include "uci.h"
+#include "syzygy/tbprobe.h"
 
 using std::string;
 
@@ -37,13 +39,14 @@ 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_threads(const Option&) { Threads.read_uci_options(); }
+void on_tb_path(const Option& o) { Tablebases::init(o); }
 
 
 /// Our case insensitive less() function as required by UCI protocol
-bool CaseInsensitiveLess::operator() (const string& s1, const string& s2) const {
+bool ci_less(char c1, char c2) { return tolower(c1) < tolower(c2); }
 
-  return std::lexicographical_compare(s1.begin(), s1.end(), s2.begin(), s2.end(),
-         [](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);
 }
 
 
@@ -66,6 +69,10 @@ void init(OptionsMap& o) {
   o["Minimum Thinking Time"] << Option(20, 0, 5000);
   o["Slow Mover"]            << Option(80, 10, 1000);
   o["UCI_Chess960"]          << Option(false);
+  o["SyzygyPath"]            << Option("<empty>", on_tb_path);
+  o["SyzygyProbeDepth"]      << Option(1, 1, 100);
+  o["Syzygy50MoveRule"]      << Option(true);
+  o["SyzygyProbeLimit"]      << Option(6, 0, 6);
 }
 
 
@@ -75,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 (auto it : om)
-          if (it.second.idx == idx)
+      for (OptionsMap::const_iterator it = om.begin(); it != om.end(); ++it)
+          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;
@@ -89,7 +96,6 @@ std::ostream& operator<<(std::ostream& os, const OptionsMap& om) {
 
               break;
           }
-
   return os;
 }
 
@@ -106,11 +112,12 @@ Option::Option(OnChange f) : type("button"), min(0), max(0), on_change(f)
 {}
 
 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); }
+{ std::ostringstream ss; ss << v; defaultValue = currentValue = ss.str(); }
+
 
 Option::operator int() const {
   assert(type == "check" || type == "spin");
-  return (type == "spin" ? stoi(currentValue) : currentValue == "true");
+  return (type == "spin" ? atoi(currentValue.c_str()) : currentValue == "true");
 }
 
 Option::operator std::string() const {
@@ -140,7 +147,7 @@ Option& Option::operator=(const string& v) {
 
   if (   (type != "button" && v.empty())
       || (type == "check" && v != "true" && v != "false")
-      || (type == "spin" && (stoi(v) < min || stoi(v) > max)))
+      || (type == "spin" && (atoi(v.c_str()) < min || atoi(v.c_str()) > max)))
       return *this;
 
   if (type != "button")