X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fuci.cpp;h=8f6416bdcb7b866b984e53b5ac6be64c4a7e47b8;hp=b8b371acfc036a4a08570773d058b28ef12173fe;hb=44236f4ed9844598e1cb065937c3770a938964b2;hpb=2e86d1febc163e076320a6a21060fc5a1c7c0dff diff --git a/src/uci.cpp b/src/uci.cpp index b8b371ac..8f6416bd 100644 --- a/src/uci.cpp +++ b/src/uci.cpp @@ -2,6 +2,7 @@ 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-2017 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 @@ -17,6 +18,7 @@ along with this program. If not, see . */ +#include #include #include #include @@ -26,8 +28,10 @@ #include "position.h" #include "search.h" #include "thread.h" +#include "tt.h" #include "timeman.h" #include "uci.h" +#include "syzygy/tbprobe.h" using namespace std; @@ -38,10 +42,10 @@ namespace { // FEN string of the initial position, normal chess const char* StartFEN = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1"; - // Stack to keep track of the position states along the setup moves (from the + // A list to keep track of the position states along the setup moves (from the // start position to the position just before the search starts). Needed by // 'draw by repetition' detection. - Search::StateStackPtr SetupStates; + StateListPtr States(new std::deque(1)); // position() is called when engine receives the "position" UCI command. @@ -67,14 +71,14 @@ namespace { else return; - pos.set(fen, Options["UCI_Chess960"], Threads.main()); - SetupStates = Search::StateStackPtr(new std::stack); + States = StateListPtr(new std::deque(1)); + pos.set(fen, Options["UCI_Chess960"], &States->back(), Threads.main()); // Parse move list (if any) while (is >> token && (m = UCI::to_move(pos, token)) != MOVE_NONE) { - SetupStates->push(StateInfo()); - pos.do_move(m, SetupStates->top(), pos.gives_check(m, CheckInfo(pos))); + States->push_back(StateInfo()); + pos.do_move(m, States->back()); } } @@ -90,11 +94,11 @@ namespace { // Read option name (can contain spaces) while (is >> token && token != "value") - name += string(" ", !name.empty()) + token; + name += string(" ", name.empty() ? 0 : 1) + token; // Read option value (can contain spaces) while (is >> token) - value += string(" ", !value.empty()) + token; + value += string(" ", value.empty() ? 0 : 1) + token; if (Options.count(name)) Options[name] = value; @@ -107,11 +111,13 @@ namespace { // the thinking time and other parameters from the input string, then starts // the search. - void go(const Position& pos, istringstream& is) { + void go(Position& pos, istringstream& is) { Search::LimitsType limits; string token; + limits.startTime = now(); // As early as possible! + while (is >> token) if (token == "searchmoves") while (is >> token) @@ -126,10 +132,10 @@ namespace { else if (token == "nodes") is >> limits.nodes; else if (token == "movetime") is >> limits.movetime; else if (token == "mate") is >> limits.mate; - else if (token == "infinite") limits.infinite = true; - else if (token == "ponder") limits.ponder = true; + else if (token == "infinite") limits.infinite = 1; + else if (token == "ponder") limits.ponder = 1; - Threads.start_thinking(pos, limits, SetupStates); + Threads.start_thinking(pos, States, limits); } } // namespace @@ -143,8 +149,11 @@ namespace { void UCI::loop(int argc, char* argv[]) { - Position pos(StartFEN, false, Threads.main()); // The root position + Position pos; string token, cmd; + Thread* uiThread = new Thread(); + + pos.set(StartFEN, false, &States->back(), uiThread); for (int i = 1; i < argc; ++i) cmd += std::string(argv[i]) + " "; @@ -159,30 +168,26 @@ void UCI::loop(int argc, char* argv[]) { is >> skipws >> token; // The GUI sends 'ponderhit' to tell us to ponder on the same move the - // opponent has played. In case Signals.stopOnPonderhit is set we are + // opponent has played. In case Threads.stopOnPonderhit is set we are // waiting for 'ponderhit' to stop the search (for instance because we // already ran out of time), otherwise we should continue searching but // switching from pondering to normal search. if ( token == "quit" || token == "stop" - || (token == "ponderhit" && Search::Signals.stopOnPonderhit)) + || (token == "ponderhit" && Threads.stopOnPonderhit)) { - Search::Signals.stop = true; - Threads.main()->notify_one(); // Could be sleeping + Threads.stop = true; + Threads.main()->start_searching(true); // Could be sleeping } else if (token == "ponderhit") - Search::Limits.ponder = false; // Switch to normal search + Search::Limits.ponder = 0; // Switch to normal search else if (token == "uci") sync_cout << "id name " << engine_info(true) << "\n" << Options << "\nuciok" << sync_endl; - else if (token == "ucinewgame") - { - Search::reset(); - Time.availableNodes = 0; - } + else if (token == "ucinewgame") Search::clear(); else if (token == "isready") sync_cout << "readyok" << sync_endl; else if (token == "go") go(pos, is); else if (token == "position") position(pos, is); @@ -209,7 +214,8 @@ void UCI::loop(int argc, char* argv[]) { } while (token != "quit" && argc == 1); // Passed args have one-shot behaviour - Threads.main()->join(); // Cannot quit whilst the search is running + Threads.main()->wait_for_search_finished(); + delete uiThread; } @@ -222,6 +228,8 @@ void UCI::loop(int argc, char* argv[]) { string UCI::value(Value v) { + assert(-VALUE_INFINITE < v && v < VALUE_INFINITE); + stringstream ss; if (abs(v) < VALUE_MATE - MAX_PLY)