/*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
  Copyright (C) 2008-2010 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
  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 <cctype>
#include <iostream>
#include <sstream>

#include "misc.h"
#include "thread.h"
#include "ucioption.h"

using std::string;
using std::cout;
using std::endl;

OptionsMap Options; // Global object


// Our case insensitive less() function as required by UCI protocol
bool CaseInsensitiveLess::operator() (const string& s1, const string& s2) const {

  int c1, c2;
  size_t i = 0;

  while (i < s1.size() && i < s2.size())
  {
      c1 = tolower(s1[i]);
      c2 = tolower(s2[i++]);

      if (c1 != c2)
          return c1 < c2;
  }
  return s1.size() < s2.size();
}


// stringify() converts a numeric value of type T to a std::string
template<typename T>
static string stringify(const T& v) {

  std::ostringstream ss;
  ss << v;
  return ss.str();
}


/// OptionsMap c'tor initializes the UCI options to their hard coded default
/// values and initializes the default value of "Threads" and "Minimum Split Depth"
/// parameters according to the number of CPU cores.

OptionsMap::OptionsMap() {

  OptionsMap& o = *this;

  o["Use Search Log"] = Option(false);
  o["Search Log Filename"] = Option("SearchLog.txt");
  o["Book File"] = Option("book.bin");
  o["Best Book Move"] = Option(false);
  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["Check Extension (PV nodes)"] = Option(2, 0, 2);
  o["Check Extension (non-PV nodes)"] = Option(1, 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["Minimum Split Depth"] = Option(4, 4, 7);
  o["Maximum Number of Threads per Split Point"] = Option(5, 4, 8);
  o["Threads"] = Option(1, 1, MAX_THREADS);
  o["Use Sleeping Threads"] = Option(true);
  o["Hash"] = Option(32, 4, 8192);
  o["Clear Hash"] = Option(false, "button");
  o["Ponder"] = Option(true);
  o["OwnBook"] = Option(true);
  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(200, 0, 30000);
  o["Emergency Move Time"] = Option(70, 0, 5000);
  o["Minimum Thinking Time"] = Option(20, 0, 5000);
  o["UCI_Chess960"] = Option(false);
  o["UCI_AnalyseMode"] = Option(false);

  // Set some SMP parameters accordingly to the detected CPU count
  Option& thr = o["Threads"];
  Option& msd = o["Minimum Split Depth"];

  thr.defaultValue = thr.currentValue = stringify(cpu_count());

  if (cpu_count() >= 8)
      msd.defaultValue = msd.currentValue = stringify(7);
}


/// OptionsMap::print_all() returns a string with all the UCI options in chronological
/// insertion order (the idx field) and in the format defined by the UCI protocol.

string OptionsMap::print_all() const {

  std::stringstream s;

  for (size_t i = 0; i <= size(); i++)
      for (OptionsMap::const_iterator it = begin(); it != end(); ++it)
          if (it->second.idx == i)
          {
              const Option& o = it->second;
              s << "\noption name " << it->first << " type " << o.type;

              if (o.type != "button")
                  s << " default " << o.defaultValue;

              if (o.type == "spin")
                  s << " min " << o.minValue << " max " << o.maxValue;

              break;
          }
  return s.str();
}


/// Option class c'tors

Option::Option(const char* def) : type("string"), minValue(0), maxValue(0), idx(Options.size())
{ defaultValue = currentValue = def; }

Option::Option(bool def, string t) : type(t), minValue(0), maxValue(0), idx(Options.size())
{ defaultValue = currentValue = (def ? "true" : "false"); }

Option::Option(int def, int minv, int maxv) : type("spin"), minValue(minv), maxValue(maxv), idx(Options.size())
{ defaultValue = currentValue = stringify(def); }


/// set_value() updates currentValue of the Option object. 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.

void Option::set_value(const string& v) {

  assert(!type.empty());

  if (v.empty())
      return;

  if ((type == "check" || type == "button") != (v == "true" || v == "false"))
      return;

  if (type == "spin")
  {
      int val = atoi(v.c_str());
      if (val < minValue || val > maxValue)
          return;
  }

  currentValue = v;
}