X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;ds=sidebyside;f=src%2Fuci.cpp;h=4d68c86a04f3263216bfd764f6c4e3e535280e55;hb=fc290dc30b1f6a50fd5fd6732c276ff76305f2aa;hp=39270c6ff93697b1ff3206f4022637be613fecad;hpb=1d0159075e916c738760b788d605b71b3736cb7c;p=stockfish diff --git a/src/uci.cpp b/src/uci.cpp index 39270c6f..4d68c86a 100644 --- a/src/uci.cpp +++ b/src/uci.cpp @@ -21,6 +21,7 @@ #include #include #include +#include #include "evaluate.h" #include "misc.h" @@ -36,6 +37,11 @@ namespace { // FEN string for the initial position const string StartPositionFEN = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1"; + // Keep track of position keys along the setup moves (from start position to the + // position just before to start searching). This is needed by draw detection + // where, due to 50 moves rule, we need to check at most 100 plies back. + StateInfo StateRingBuf[102], *SetupState = StateRingBuf; + // UCIParser is a class for parsing UCI input. The class // is actually a string stream built on a given input string. typedef istringstream UCIParser; @@ -59,7 +65,7 @@ bool execute_uci_command(const string& cmd) { UCIParser up(cmd); string token; - up >> token; // operator>>() skips any whitespace + up >> skipws >> token; if (token == "quit") return false; @@ -120,9 +126,10 @@ namespace { void set_position(Position& pos, UCIParser& up) { + Move m; string token, fen; - up >> token; // operator>>() skips any whitespace + up >> token; if (token == "startpos") { @@ -139,8 +146,14 @@ namespace { else return; // Parse move list (if any) - while (up >> token) - pos.do_setup_move(move_from_uci(pos, token)); + while (up >> token && (m = move_from_uci(pos, token)) != MOVE_NONE) + { + pos.do_move(m, *SetupState); + + // Increment pointer to StateRingBuf circular buffer + if (++SetupState - StateRingBuf >= 102) + SetupState = StateRingBuf; + } } @@ -150,24 +163,20 @@ namespace { void set_option(UCIParser& up) { - string token, name; - string value = "true"; // UCI buttons don't have a "value" field + string token, name, value; up >> token; // Consume "name" token - up >> name; // Read option name - // Handle names with included spaces + // Read option name (can contain spaces) while (up >> token && token != "value") - name += " " + token; - - up >> value; // Read option value + name += string(" ", !name.empty()) + token; - // Handle values with included spaces + // Read option value (can contain spaces) while (up >> token) - value += " " + token; + value += string(" ", !value.empty()) + token; if (Options.find(name) != Options.end()) - Options[name].set_value(value); + Options[name].set_value(value.empty() ? "true" : value); // UCI buttons don't have "value" else cout << "No such option: " << name << endl; } @@ -182,7 +191,7 @@ namespace { string token; SearchLimits limits; - Move searchMoves[MAX_MOVES], *cur = searchMoves; + std::vector searchMoves; int time[] = { 0, 0 }, inc[] = { 0, 0 }; while (up >> token) @@ -209,22 +218,20 @@ namespace { up >> limits.maxTime; else if (token == "searchmoves") while (up >> token) - *cur++ = move_from_uci(pos, token); + searchMoves.push_back(move_from_uci(pos, token)); } - *cur = MOVE_NONE; + searchMoves.push_back(MOVE_NONE); limits.time = time[pos.side_to_move()]; limits.increment = inc[pos.side_to_move()]; - assert(pos.is_ok()); - - return think(pos, limits, searchMoves); + return think(pos, limits, &searchMoves[0]); } // perft() is called when engine receives the "perft" command. // The function calls perft() passing the required search depth - // then prints counted nodes and elapsed time. + // then prints counted leaf nodes and elapsed time. void perft(Position& pos, UCIParser& up) {