+ d = lastMove;
+ p = firstMove - 1;
+
+ d->score = -1; // right guard
+
+ // Split positives vs non-positives
+ do {
+ while ((++p)->score > 0) {}
+
+ if (p != d)
+ {
+ while (--d != p && d->score <= 0) {}
+
+ tmp = *p;
+ *p = *d;
+ *d = tmp;
+ }
+
+ } while (p != d);
+
+ // Sort just positive scored moves, remaining only when we get there
+ insertion_sort<T, T*>(firstMove, p);
+ *lastPositive = p;
+}
+
+// Picks up the best move in range [curMove, lastMove), one per cycle.
+// It is faster then sorting all the moves in advance when moves are few,
+// as normally are the possible captures. Note that is not a stable alghoritm.
+template<typename T>
+inline T pick_best(T* curMove, T* lastMove)
+{
+ T bestMove, tmp;
+
+ bestMove = *curMove;
+ while (++curMove != lastMove)
+ {
+ if (bestMove < *curMove)
+ {
+ tmp = *curMove;
+ *curMove = bestMove;
+ bestMove = tmp;
+ }
+ }
+ return bestMove;
+}