/*
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
#include <iostream>
#include <sstream>
#include <string>
-#include <vector>
#include "evaluate.h"
-#include "misc.h"
#include "position.h"
#include "search.h"
#include "thread.h"
+#include "tt.h"
#include "ucioption.h"
using namespace std;
+extern void benchmark(const Position& pos, istream& is);
+
namespace {
// FEN string of the initial position, normal chess
void set_option(istringstream& up);
void set_position(Position& pos, istringstream& up);
void go(Position& pos, istringstream& up);
- void perft(Position& pos, istringstream& up);
}
/// 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, Threads.main_thread()); // 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);
if (token == "quit" || token == "stop")
{
Search::Signals.stop = true;
- Threads[0].wake_up(); // In case is waiting for stop or ponderhit
+ Threads.wait_for_search_finished(); // Cannot quit while threads are running
}
else if (token == "ponderhit")
Search::Limits.ponder = false;
if (Search::Signals.stopOnPonderhit)
+ {
Search::Signals.stop = true;
-
- Threads[0].wake_up(); // In case is waiting for stop or ponderhit
+ Threads.main_thread()->wake_up(); // Could be sleeping
+ }
}
else if (token == "go")
go(pos, is);
else if (token == "ucinewgame")
- pos.from_fen(StartFEN, false);
+ TT.clear();
else if (token == "isready")
cout << "readyok" << endl;
else if (token == "setoption")
set_option(is);
- else if (token == "perft")
- perft(pos, is);
-
else if (token == "d")
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(pos, is);
else if (token == "key")
cout << "key: " << hex << pos.key()
<< "\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 if (token == "perft" && (is >> token)) // Read depth
+ {
+ stringstream ss;
+
+ ss << Options["Hash"] << " "
+ << Options["Threads"] << " " << token << " current perft";
+
+ benchmark(pos, ss);
+ }
+
else
cout << "Unknown command: " << cmd << endl;
+
+ if (!args.empty()) // Command line arguments have one-shot behaviour
+ {
+ Threads.wait_for_search_finished();
+ break;
+ }
}
}
else
return;
- pos.from_fen(fen, Options["UCI_Chess960"].value<bool>());
+ pos.from_fen(fen, Options["UCI_Chess960"], Threads.main_thread());
// Parse move list (if any)
while (is >> token && (m = move_from_uci(pos, token)) != MOVE_NONE)
value += string(" ", !value.empty()) + token;
if (Options.count(name))
- Options[name] = (value.empty() ? "true" : value); // UCI buttons don't have "value"
+ 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<Move> searchMoves;
- int time[] = { 0, 0 }, inc[] = { 0, 0 };
+ vector<Move> 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);
- }
-
-
- // perft() is called when engine receives the "perft" command. The function
- // calls perft() with the required search depth then prints counted leaf nodes
- // and elapsed time.
-
- void perft(Position& pos, istringstream& is) {
-
- int depth, time;
-
- if (!(is >> depth))
- return;
-
- time = system_time();
-
- int64_t n = Search::perft(pos, depth * ONE_PLY);
-
- time = system_time() - time;
-
- std::cout << "\nNodes " << n
- << "\nTime (ms) " << time
- << "\nNodes/second " << int(n / (time / 1000.0)) << std::endl;
+ Threads.start_searching(pos, limits, searchMoves);
}
}
projects / stockfish / blobdiff