X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fuci.cpp;h=718c78752502b61bd991b25191c94b2d30487e41;hp=9faf842f0f4b3e41a723d4a2b0fab80e4f654006;hb=258da28e79d99f75e0b626697bda2d459a37c0e6;hpb=9cb187762a68e431559ee9e4b1ed8c6f16826d89 diff --git a/src/uci.cpp b/src/uci.cpp index 9faf842f..718c7875 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" @@ -84,9 +83,6 @@ void uci_loop() { else if (token == "go") go(pos, is); - else if (token == "ucinewgame") - pos.from_fen(StartFEN, false); - else if (token == "isready") cout << "readyok" << endl; @@ -106,10 +102,7 @@ void uci_loop() { pos.flip_me(); 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 == "key") cout << "key: " << hex << pos.key() @@ -117,8 +110,7 @@ void uci_loop() { << "\npawn key: " << pos.pawn_key() << endl; else if (token == "uci") - cout << "id name " << engine_name() - << "\nid author " << engine_authors() + cout << "id name " << engine_info(true) << "\n" << Options << "\nuciok" << endl; else @@ -183,14 +175,10 @@ 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; } @@ -202,7 +190,7 @@ namespace { string token; Search::LimitsType limits; - std::vector searchMoves; + std::set searchMoves; int time[] = { 0, 0 }, inc[] = { 0, 0 }; while (is >> token) @@ -229,7 +217,7 @@ namespace { is >> limits.maxTime; else if (token == "searchmoves") while (is >> token) - searchMoves.push_back(move_from_uci(pos, token)); + searchMoves.insert(move_from_uci(pos, token)); } limits.time = time[pos.side_to_move()]; @@ -245,19 +233,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; + << "\nTime (ms) " << e + << "\nNodes/second " << int(n / (e / 1000.0)) << std::endl; } }