X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=src%2Fuci.cpp;h=cfd112172bf11fe048c4a78447c43888006ca10b;hb=7de40076ac5b5090f8c74a8bafeae06d6ec20ec3;hp=9593b593c897fd1d626d452d62fdb8b8dc6b5df9;hpb=1d368bbbdc50bbb4e10933c4986abc07a08010fd;p=stockfish
diff --git a/src/uci.cpp b/src/uci.cpp
index 9593b593..cfd11217 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-2014 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
@@ -17,251 +17,275 @@
along with this program. If not, see .
*/
-
-////
-//// Includes
-////
-
-#include
-#include
+#include
#include
#include
#include
#include "evaluate.h"
-#include "misc.h"
-#include "move.h"
#include "movegen.h"
#include "position.h"
#include "search.h"
-#include "ucioption.h"
+#include "thread.h"
+#include "tt.h"
+#include "uci.h"
using namespace std;
+extern void benchmark(const Position& pos, istream& is);
namespace {
- // FEN string for the initial position
- const string StartPositionFEN = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";
-
- // UCIParser is a class for parsing UCI input. The class
- // is actually a string stream built on a given input string.
- typedef istringstream UCIParser;
-
- // Local functions
- void set_option(UCIParser& up);
- void set_position(Position& pos, UCIParser& up);
- bool go(Position& pos, UCIParser& up);
- void perft(Position& pos, UCIParser& up);
-}
+ // FEN string of the initial position, normal chess
+ const char* StartFEN = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";
+ // Keep a track of the position keys along the setup moves (from the start position
+ // to the position just before the search starts). This is needed by the repetition
+ // draw detection code.
+ Search::StateStackPtr SetupStates;
-/// execute_uci_command() takes a string as input, uses a UCIParser
-/// object to parse this text string as a UCI command, and calls
-/// the appropriate functions. In addition to the UCI commands,
-/// the function also supports a few debug commands.
-bool execute_uci_command(const string& cmd) {
+ // position() is called when engine receives the "position" UCI command.
+ // The function sets up the position described in the given FEN string ("fen")
+ // or the starting position ("startpos") and then makes the moves given in the
+ // following move list ("moves").
- static Position pos(StartPositionFEN, false, 0); // The root position
- UCIParser up(cmd);
- string token;
+ void position(Position& pos, istringstream& is) {
- up >> token; // operator>>() skips any whitespace
+ Move m;
+ string token, fen;
- if (token == "quit")
- return false;
+ is >> token;
- else if (token == "go")
- return go(pos, up);
+ if (token == "startpos")
+ {
+ fen = StartFEN;
+ is >> token; // Consume "moves" token if any
+ }
+ else if (token == "fen")
+ while (is >> token && token != "moves")
+ fen += token + " ";
+ else
+ return;
- else if (token == "uci")
- cout << "id name " << engine_name()
- << "\nid author " << engine_authors()
- << "\n" << Options.print_all()
- << "\nuciok" << endl;
+ pos.set(fen, Options["UCI_Chess960"], Threads.main());
+ SetupStates = Search::StateStackPtr(new std::stack());
- else if (token == "ucinewgame")
- pos.from_fen(StartPositionFEN, false);
+ // 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());
+ }
+ }
- else if (token == "isready")
- cout << "readyok" << endl;
- else if (token == "position")
- set_position(pos, up);
+ // setoption() is called when engine receives the "setoption" UCI command. The
+ // function updates the UCI option ("name") to the given value ("value").
- else if (token == "setoption")
- set_option(up);
+ void setoption(istringstream& is) {
- else if (token == "d")
- pos.print();
+ string token, name, value;
- else if (token == "eval")
- {
- read_evaluation_uci_options(pos.side_to_move());
- cout << trace_evaluate(pos) << endl;
- }
+ is >> token; // Consume "name" token
- else if (token == "key")
- cout << "key: " << hex << pos.get_key()
- << "\nmaterial key: " << pos.get_material_key()
- << "\npawn key: " << pos.get_pawn_key() << endl;
+ // Read option name (can contain spaces)
+ while (is >> token && token != "value")
+ name += string(" ", !name.empty()) + token;
- else if (token == "perft")
- perft(pos, up);
+ // Read option value (can contain spaces)
+ while (is >> token)
+ value += string(" ", !value.empty()) + token;
- else if (token == "flip")
- {
- Position p(pos, pos.thread());
- pos.flipped_copy(p);
+ if (Options.count(name))
+ Options[name] = value;
+ else
+ sync_cout << "No such option: " << name << sync_endl;
}
- else
- cout << "Unknown command: " << cmd << endl;
- return true;
-}
+ // go() is called when engine receives the "go" UCI command. The function sets
+ // the thinking time and other parameters from the input string, and starts
+ // the search.
-////
-//// Local functions
-////
+ void go(const Position& pos, istringstream& is) {
-namespace {
+ Search::LimitsType limits;
+ string token;
- // set_position() is called when Stockfish receives the "position" UCI
- // command. The input parameter is a UCIParser. It is assumed
- // that this parser has consumed the first token of the UCI command
- // ("position"), and is ready to read the second token ("startpos"
- // or "fen", if the input is well-formed).
+ while (is >> token)
+ {
+ if (token == "searchmoves")
+ while (is >> token)
+ limits.searchmoves.push_back(UCI::to_move(pos, token));
+
+ else if (token == "wtime") is >> limits.time[WHITE];
+ else if (token == "btime") is >> limits.time[BLACK];
+ else if (token == "winc") is >> limits.inc[WHITE];
+ else if (token == "binc") is >> limits.inc[BLACK];
+ else if (token == "movestogo") is >> limits.movestogo;
+ else if (token == "depth") is >> limits.depth;
+ 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;
+ }
- void set_position(Position& pos, UCIParser& up) {
+ Threads.start_thinking(pos, limits, SetupStates);
+ }
- string fen, token;
+} // namespace
+
+
+/// Wait for a command from the user, parse this text string as an UCI command,
+/// and call the appropriate functions. Also intercepts EOF from stdin to ensure
+/// 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(int argc, char* argv[]) {
+
+ Position pos(StartFEN, false, Threads.main()); // The root position
+ string token, cmd;
+
+ for (int i = 1; i < argc; ++i)
+ cmd += std::string(argv[i]) + " ";
+
+ do {
+ if (argc == 1 && !getline(cin, cmd)) // Block here waiting for input
+ cmd = "quit";
+
+ istringstream is(cmd);
+
+ is >> skipws >> token;
+
+ if (token == "quit" || token == "stop" || token == "ponderhit")
+ {
+ // 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
+ // waiting for 'ponderhit' to stop the search (for instance because we
+ // already ran out of time), otherwise we should continue searching but
+ // switch from pondering to normal search.
+ if (token != "ponderhit" || Search::Signals.stopOnPonderhit)
+ {
+ Search::Signals.stop = true;
+ Threads.main()->notify_one(); // Could be sleeping
+ }
+ else
+ Search::Limits.ponder = false;
+ }
+ else if (token == "perft")
+ {
+ int depth;
+ stringstream ss;
+
+ is >> depth;
+ ss << Options["Hash"] << " "
+ << Options["Threads"] << " " << depth << " current " << token;
+
+ benchmark(pos, ss);
+ }
+ else if (token == "key")
+ sync_cout << hex << uppercase << setfill('0')
+ << "position key: " << setw(16) << pos.key()
+ << "\nmaterial key: " << setw(16) << pos.material_key()
+ << "\npawn key: " << setw(16) << pos.pawn_key()
+ << dec << nouppercase << setfill(' ') << sync_endl;
+
+ else if (token == "uci")
+ sync_cout << "id name " << engine_info(true)
+ << "\n" << Options
+ << "\nuciok" << sync_endl;
+
+ else if (token == "ucinewgame") TT.clear();
+ else if (token == "go") go(pos, is);
+ else if (token == "position") position(pos, is);
+ else if (token == "setoption") setoption(is);
+ else if (token == "flip") pos.flip();
+ else if (token == "bench") benchmark(pos, is);
+ else if (token == "d") sync_cout << pos.pretty() << sync_endl;
+ else if (token == "isready") sync_cout << "readyok" << sync_endl;
+ else if (token == "eval") sync_cout << Eval::trace(pos) << sync_endl;
+ else
+ sync_cout << "Unknown command: " << cmd << sync_endl;
+
+ } while (token != "quit" && argc == 1); // Passed args have one-shot behaviour
+
+ Threads.wait_for_think_finished(); // Cannot quit whilst the search is running
+}
- up >> token; // operator>>() skips any whitespace
- if (token == "startpos")
- {
- pos.from_fen(StartPositionFEN, false);
- up >> token; // Consume "moves" token
- }
- else if (token == "fen")
- {
- while (up >> token && token != "moves")
- fen += token + " ";
+/// format_value() converts a Value to a string suitable for use with the UCI
+/// protocol specifications:
+///
+/// cp The score from the engine's point of view in centipawns.
+/// mate Mate in y moves, not plies. If the engine is getting mated
+/// use negative values for y.
- pos.from_fen(fen, Options["UCI_Chess960"].value());
- }
- else return;
+string UCI::format_value(Value v, Value alpha, Value beta) {
- // Parse move list (if any)
- while (up >> token)
- pos.do_setup_move(move_from_uci(pos, token));
- }
+ stringstream ss;
+ if (abs(v) < VALUE_MATE_IN_MAX_PLY)
+ ss << "cp " << v * 100 / PawnValueEg;
+ else
+ ss << "mate " << (v > 0 ? VALUE_MATE - v + 1 : -VALUE_MATE - v) / 2;
- // set_option() is called when Stockfish receives the "setoption" UCI
- // command. The input parameter is a UCIParser. It is assumed
- // that this parser has consumed the first token of the UCI command
- // ("setoption"), and is ready to read the second token ("name", if
- // the input is well-formed).
+ ss << (v >= beta ? " lowerbound" : v <= alpha ? " upperbound" : "");
- void set_option(UCIParser& up) {
+ return ss.str();
+}
- string value = "true"; // UCI buttons don't have a "value" field
- string token, name;
- up >> token; // Consume "name" token
- up >> name; // Read option name
+/// format_square() converts a Square to a string (g1, a7, etc.)
- // Handle names with included spaces
- while (up >> token && token != "value")
- name += " " + token;
+std::string UCI::format_square(Square s) {
- up >> value; // Read option value
+ char ch[] = { char('a' + file_of(s)),
+ char('1' + rank_of(s)), 0 }; // Zero-terminating
+ return ch;
+}
- // Handle values with included spaces
- while (up >> token)
- value += " " + token;
- if (Options.find(name) != Options.end())
- Options[name].set_value(value);
- else
- cout << "No such option: " << name << endl;
- }
+/// format_move() converts a Move to a string in coordinate notation
+/// (g1f3, a7a8q, etc.). The only special case is castling moves, where we print
+/// in the e1g1 notation in normal chess mode, and in e1h1 notation in chess960
+/// mode. Internally castling moves are always encoded as "king captures rook".
+string UCI::format_move(Move m, bool chess960) {
- // go() is called when Stockfish receives the "go" UCI command. The
- // input parameter is a UCIParser. It is assumed that this
- // parser has consumed the first token of the UCI command ("go"),
- // and is ready to read the second token. The function sets the
- // thinking time and other parameters from the input string, and
- // calls think() (defined in search.cpp) with the appropriate
- // parameters. Returns false if a quit command is received while
- // thinking, returns true otherwise.
+ Square from = from_sq(m);
+ Square to = to_sq(m);
- bool go(Position& pos, UCIParser& up) {
+ if (m == MOVE_NONE)
+ return "(none)";
- string token;
- int time[] = { 0, 0 }, inc[] = { 0, 0 };
- SearchLimits limits(0, 0, 0, 0, 0, 0, false, false);
- Move searchMoves[MOVES_MAX] = { MOVE_NONE };
- Move* cur = searchMoves;
+ if (m == MOVE_NULL)
+ return "0000";
- while (up >> token)
- {
- if (token == "infinite")
- limits.infinite = true;
- else if (token == "ponder")
- limits.ponder = true;
- else if (token == "wtime")
- up >> time[WHITE];
- else if (token == "btime")
- up >> time[BLACK];
- else if (token == "winc")
- up >> inc[WHITE];
- else if (token == "binc")
- up >> inc[BLACK];
- else if (token == "movestogo")
- up >> limits.movesToGo;
- else if (token == "depth")
- up >> limits.maxDepth;
- else if (token == "nodes")
- up >> limits.maxNodes;
- else if (token == "movetime")
- up >> limits.maxTime;
- else if (token == "searchmoves")
- {
- while (up >> token)
- *cur++ = move_from_uci(pos, token);
-
- *cur = MOVE_NONE;
- }
- }
+ if (type_of(m) == CASTLING && !chess960)
+ to = make_square(to > from ? FILE_G : FILE_C, rank_of(from));
- assert(pos.is_ok());
+ string move = format_square(from) + format_square(to);
- limits.time = time[pos.side_to_move()];
- limits.increment = inc[pos.side_to_move()];
+ if (type_of(m) == PROMOTION)
+ move += " pnbrqk"[promotion_type(m)];
- return think(pos, limits, searchMoves);
- }
+ return move;
+}
- void perft(Position& pos, UCIParser& up) {
- int depth, tm;
- int64_t n;
+/// to_move() takes a position and a string representing a move in
+/// simple coordinate notation and returns an equivalent legal Move if any.
- if (!(up >> depth))
- return;
+Move UCI::to_move(const Position& pos, string& str) {
- tm = get_system_time();
+ if (str.length() == 5) // Junior could send promotion piece in uppercase
+ str[4] = char(tolower(str[4]));
- n = perft(pos, depth * ONE_PLY);
+ for (MoveList it(pos); *it; ++it)
+ if (str == format_move(*it, pos.is_chess960()))
+ return *it;
- tm = get_system_time() - tm;
- std::cout << "\nNodes " << n
- << "\nTime (ms) " << tm
- << "\nNodes/second " << int(n / (tm / 1000.0)) << std::endl;
- }
+ return MOVE_NONE;
}