// Our dedicated sort in range [firstMove, lastMove), first splits
// positive scores from ramining then order seaprately the two sets.
template<typename T>
-inline void sort_moves(T* firstMove, T* lastMove)
+inline void sort_moves(T* firstMove, T* lastMove, T** lastPositive)
{
T tmp;
T *p, *d;
} while (p != d);
- // Sort positives and non-positives separately
+ // Sort just positive scored moves, remaining only when we get there
insertion_sort<T>(firstMove, p);
- insertion_sort<T>(p, lastMove);
+ *lastPositive = p;
}
// Picks up the best move in range [curMove, lastMove), one per cycle.