void benchmark(int argc, char* argv[]) {
- vector<Move> searchMoves(1, MOVE_NONE);
vector<string> fenList;
Search::LimitsType limits;
int64_t totalNodes;
// Ok, let's start the benchmark !
totalNodes = 0;
- time = get_system_time();
+ time = system_time();
for (size_t i = 0; i < fenList.size(); i++)
{
}
else
{
- Threads.start_thinking(pos, limits, searchMoves, false);
+ Threads.start_thinking(pos, limits, vector<Move>(), false);
totalNodes += Search::RootPosition.nodes_searched();
}
}
- time = get_system_time() - time;
+ time = system_time() - time;
cerr << "\n==============================="
<< "\nTotal time (ms) : " << time