+ SplitPoint* bestSp = NULL;
+ Thread* bestThread = NULL;
+ int bestScore = INT_MAX;
+
+ for (size_t i = 0; i < Threads.size(); ++i)
+ {
+ const size_t size = Threads[i]->splitPointsSize; // Local copy
+ sp = size ? &Threads[i]->splitPoints[size - 1] : nullptr;
+
+ if ( sp
+ && sp->allSlavesSearching
+ && sp->slavesMask.count() < MAX_SLAVES_PER_SPLITPOINT
+ && available_to(Threads[i]))