X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fuci.cpp;h=dd4040d732397c8752d5d9096b520afb280f7967;hp=9086a62c478f5b02a229c9734fee54afbfedbdaa;hb=e1919384a23fe728422f995369161efa192380db;hpb=ad43ce143664953087b44dd3b4324f77c212bd46 diff --git a/src/uci.cpp b/src/uci.cpp index 9086a62c..dd4040d7 100644 --- a/src/uci.cpp +++ b/src/uci.cpp @@ -1,7 +1,7 @@ /* 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 + Copyright (C) 2008-2012 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 @@ -20,7 +20,6 @@ #include #include #include -#include #include "evaluate.h" #include "misc.h" @@ -31,6 +30,8 @@ using namespace std; +extern void benchmark(istringstream& is); + namespace { // FEN string of the initial position, normal chess @@ -53,14 +54,17 @@ namespace { /// that we exit gracefully if the GUI dies unexpectedly. In addition to the UCI /// commands, the function also supports a few debug commands. -void uci_loop() { +void uci_loop(const string& args) { - Position pos(StartFEN, false, 0); // The root position + Position pos(StartFEN, false); // The root position string cmd, token; while (token != "quit") { - if (!getline(cin, cmd)) // Block here waiting for input + if (!args.empty()) + cmd = args; + + else if (!getline(cin, cmd)) // Block here waiting for input cmd = "quit"; istringstream is(cmd); @@ -68,7 +72,10 @@ void uci_loop() { is >> skipws >> token; if (token == "quit" || token == "stop") - Threads.stop_thinking(); + { + Search::Signals.stop = true; + Threads.wait_for_search_finished(); // Cannot quit while threads are running + } else if (token == "ponderhit") { @@ -78,14 +85,17 @@ void uci_loop() { Search::Limits.ponder = false; if (Search::Signals.stopOnPonderhit) - Threads.stop_thinking(); + { + Search::Signals.stop = true; + Threads.wait_for_search_finished(); // Wake up if is sleeping + } } else if (token == "go") go(pos, is); else if (token == "ucinewgame") - pos.from_fen(StartFEN, false); + { /* Avoid returning "Unknown command" */ } else if (token == "isready") cout << "readyok" << endl; @@ -103,13 +113,13 @@ void uci_loop() { pos.print(); else if (token == "flip") - pos.flip_me(); + pos.flip(); else if (token == "eval") - { - read_evaluation_uci_options(pos.side_to_move()); - cout << trace_evaluate(pos) << endl; - } + cout << Eval::trace(pos) << endl; + + else if (token == "bench") + benchmark(is); else if (token == "key") cout << "key: " << hex << pos.key() @@ -122,6 +132,12 @@ void uci_loop() { << "\nuciok" << endl; else cout << "Unknown command: " << cmd << endl; + + if (!args.empty()) // Command line arguments have one-shot behaviour + { + Threads.wait_for_search_finished(); + break; + } } } @@ -182,59 +198,51 @@ namespace { while (is >> token) value += string(" ", !value.empty()) + token; - if (!Options.count(name)) - cout << "No such option: " << name << endl; - - else if (value.empty()) // UCI buttons don't have a value - Options[name] = true; - - else + if (Options.count(name)) Options[name] = value; + else + cout << "No such option: " << name << endl; } // go() is called when engine receives the "go" UCI command. The function sets // the thinking time and other parameters from the input string, and then starts - // the main searching thread. + // the search. void go(Position& pos, istringstream& is) { - string token; Search::LimitsType limits; - std::vector searchMoves; - int time[] = { 0, 0 }, inc[] = { 0, 0 }; + vector searchMoves; + string token; while (is >> token) { - if (token == "infinite") - limits.infinite = true; - else if (token == "ponder") - limits.ponder = true; - else if (token == "wtime") - is >> time[WHITE]; + if (token == "wtime") + is >> limits.time[WHITE]; else if (token == "btime") - is >> time[BLACK]; + is >> limits.time[BLACK]; else if (token == "winc") - is >> inc[WHITE]; + is >> limits.inc[WHITE]; else if (token == "binc") - is >> inc[BLACK]; + is >> limits.inc[BLACK]; else if (token == "movestogo") - is >> limits.movesToGo; + is >> limits.movestogo; else if (token == "depth") - is >> limits.maxDepth; + is >> limits.depth; else if (token == "nodes") - is >> limits.maxNodes; + is >> limits.nodes; else if (token == "movetime") - is >> limits.maxTime; + is >> limits.movetime; + else if (token == "infinite") + limits.infinite = true; + else if (token == "ponder") + limits.ponder = true; else if (token == "searchmoves") while (is >> token) searchMoves.push_back(move_from_uci(pos, token)); } - limits.time = time[pos.side_to_move()]; - limits.increment = inc[pos.side_to_move()]; - - Threads.start_thinking(pos, limits, searchMoves, true); + Threads.start_searching(pos, limits, searchMoves); } @@ -244,19 +252,19 @@ namespace { void perft(Position& pos, istringstream& is) { - int depth, time; + int depth; if (!(is >> depth)) return; - time = system_time(); + Time time = Time::current_time(); int64_t n = Search::perft(pos, depth * ONE_PLY); - time = system_time() - time; + int e = time.elapsed(); - std::cout << "\nNodes " << n - << "\nTime (ms) " << time - << "\nNodes/second " << int(n / (time / 1000.0)) << std::endl; + cout << "\nNodes " << n + << "\nTime (ms) " << e + << "\nNodes/second " << int(n / (e / 1000.0)) << endl; } }