for (auto& to : contHistory)
for (auto& h : to)
- h.fill(0);
+ h.get()->fill(0);
- contHistory[NO_PIECE][0].fill(Search::CounterMovePruneThreshold - 1);
+ contHistory[NO_PIECE][0].get()->fill(Search::CounterMovePruneThreshold - 1);
}
/// Thread::start_searching() wakes up the thread that will start the search
}
/// ThreadPool::set() creates/destroys threads to match the requested number.
-/// Created and launced threads wil go immediately to sleep in idle_loop.
+/// Created and launched threads wil go immediately to sleep in idle_loop.
/// Upon resizing, threads are recreated to allow for binding if necessary.
void ThreadPool::set(size_t requested) {
main()->callsCnt = 0;
main()->previousScore = VALUE_INFINITE;
- main()->previousTimeReduction = 1;
+ main()->previousTimeReduction = 1.0;
}
/// ThreadPool::start_thinking() wakes up main thread waiting in idle_loop() and
rootMoves.emplace_back(m);
if (!rootMoves.empty())
- Tablebases::filter_root_moves(pos, rootMoves);
+ Tablebases::rank_root_moves(pos, rootMoves);
// After ownership transfer 'states' becomes empty, so if we stop the search
// and call 'go' again without setting a new position states.get() == NULL.
for (Thread* th : *this)
{
- th->nodes = th->tbHits = th->nmp_ply = th->nmp_odd = 0;
+ th->nodes = th->tbHits = th->nmp_min_ply = 0;
th->rootDepth = th->completedDepth = DEPTH_ZERO;
th->rootMoves = rootMoves;
th->rootPos.set(pos.fen(), pos.is_chess960(), &setupStates->back(), th);