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