#include <string>
#include "evaluate.h"
-#include "misc.h"
+#include "notation.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
const char* StartFEN = "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;
+ // position just before to start searching). Needed by repetition draw detection.
+ Search::StateStackPtr SetupStates;
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);
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")
{
Search::Limits.ponder = false;
if (Search::Signals.stopOnPonderhit)
- Threads.stop_thinking();
+ {
+ Search::Signals.stop = true;
+ Threads.main_thread()->wake_up(); // Could be sleeping
+ }
}
else if (token == "go")
go(pos, is);
+ else if (token == "ucinewgame")
+ 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")
cout << Eval::trace(pos) << endl;
+ else if (token == "bench")
+ benchmark(pos, is);
+
else if (token == "key")
cout << "key: " << hex << pos.key()
<< "\nmaterial key: " << pos.material_key()
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;
+ }
}
}
namespace {
- // set_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").
+ // set_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").
void set_position(Position& pos, istringstream& is) {
else
return;
- pos.from_fen(fen, Options["UCI_Chess960"]);
+ pos.from_fen(fen, Options["UCI_Chess960"], Threads.main_thread());
+ SetupStates = Search::StateStackPtr(new std::stack<StateInfo>());
// Parse move list (if any)
while (is >> 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;
+ SetupStates->push(StateInfo());
+ pos.do_move(m, SetupStates->top());
}
}
// 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::set<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.insert(move_from_uci(pos, 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;
-
- if (!(is >> depth))
- return;
-
- Time time = Time::current_time();
-
- int64_t n = Search::perft(pos, depth * ONE_PLY);
-
- int e = time.elapsed();
-
- std::cout << "\nNodes " << n
- << "\nTime (ms) " << e
- << "\nNodes/second " << int(n / (e / 1000.0)) << std::endl;
+ Threads.start_searching(pos, limits, searchMoves, SetupStates);
}
}
projects / stockfish / blobdiff