+// Our dedicated sort in range [firstMove, lastMove), it is well
+// tuned for non-captures where we have a lot of zero scored moves.
+template<typename T>
+inline void sort_moves(T* firstMove, T* lastMove)
+{
+ T tmp;
+ T *p, *d;
+
+ 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 positives
+ insertion_sort<T>(firstMove, p);
+
+ d = lastMove;
+ p--;
+
+ // Split zero vs negatives
+ do {
+ while ((++p)->score == 0);
+
+ if (p != d)
+ {
+ while (--d != p && d->score < 0);
+
+ tmp = *p;
+ *p = *d;
+ *d = tmp;
+ }
+
+ } while (p != d);
+
+ // Sort negatives
+ insertion_sort<T>(p, lastMove);
+}
+