-
- 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);