uint64_t nodes = 0;
TimePoint elapsed = now();
+ Position pos;
for (size_t i = 0; i < fens.size(); ++i)
{
- Position pos(fens[i], Options["UCI_Chess960"], Threads.main());
+ StateListPtr states(new std::deque<StateInfo>(1));
+ pos.set(fens[i], Options["UCI_Chess960"], &states->back(), Threads.main());
cerr << "\nPosition: " << i + 1 << '/' << fens.size() << endl;
else
{
- Search::StateStackPtr st;
limits.startTime = now();
- Threads.start_thinking(pos, limits, st);
+ Threads.start_thinking(pos, states, limits);
Threads.main()->wait_for_search_finished();
nodes += Threads.nodes_searched();
}
elapsed = now() - elapsed + 1; // Ensure positivity to avoid a 'divide by zero'
- dbg_print(); // Just before to exit
+ dbg_print(); // Just before exiting
cerr << "\n==========================="
<< "\nTotal time (ms) : " << elapsed