string token;

Search::LimitsType limits;

vector<string> fens;

// Assign default values to missing arguments

string ttSize = (is >> token) ? token : "32";

string threads = (is >> token) ? token : "1";

string limit = (is >> token) ? token : "13";

string fenFile = (is >> token) ? token : "default";

string limitType = (is >> token) ? token : "depth";

Options["Hash"] = ttSize;

Options["Threads"] = threads;

TT.clear();

if (limitType == "time")

limits.movetime = 1000 * atoi(limit.c_str()); // movetime is in ms

else if (limitType == "nodes")

limits.nodes = atoi(limit.c_str());

else if (limitType == "mate")

limits.mate = atoi(limit.c_str());

else

limits.depth = atoi(limit.c_str());

if (fenFile == "default")

fens.assign(Defaults, Defaults + 30);

else if (fenFile == "current")

fens.push_back(current.fen());

else

{

string fen;

ifstream file(fenFile.c_str());

if (!file.is_open())

{

cerr << "Unable to open file " << fenFile << endl;

return;

}

while (getline(file, fen))

if (!fen.empty())

fens.push_back(fen);

file.close();

}

int64_t nodes = 0;

Search::StateStackPtr st;

Time::point elapsed = Time::now();

for (size_t i = 0; i < fens.size(); ++i)

{

Position pos(fens[i], Options["UCI_Chess960"], Threads.main());

cerr << "\nPosition: " << i + 1 << '/' << fens.size() << endl;

if (limitType == "perft")

{

size_t cnt = Search::perft(pos, limits.depth * ONE_PLY);

cerr << "\nPerft " << limits.depth << " leaf nodes: " << cnt << endl;

nodes += cnt;

}

else

{

Threads.start_thinking(pos, limits, vector<Move>(), st);

Threads.wait_for_think_finished();

nodes += Search::RootPos.nodes_searched();

}

}

elapsed = Time::now() - elapsed + 1; // Assure positive to avoid a 'divide by zero'

cerr << "\n==========================="

<< "\nTotal time (ms) : " << elapsed

<< "\nNodes searched : " << nodes

<< "\nNodes/second : " << 1000 * nodes / elapsed << endl;