X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmove.h;fp=src%2Fmove.h;h=a40c058e31c869227faf1c49353bf969ca264cf8;hp=06c9969ffb7e07929f3dcb5d5dd34445bd5880fe;hb=6235904898c67e0609ba06dc9f92e1f7325dd176;hpb=5b0849431221b09499b9f55c901da249ffdcd566

diff --git a/src/move.h b/src/move.h
index 06c9969f..a40c058e 100644
--- a/src/move.h
+++ b/src/move.h
@@ -64,8 +64,7 @@ struct MoveStack {
   int score;
 };
 
-// Note that operator< is set up such that sorting will be in descending order
-inline bool operator<(const MoveStack& f, const MoveStack& s) { return s.score < f.score; }
+inline bool operator<(const MoveStack& f, const MoveStack& s) { return f.score < s.score; }
 
 // An helper insertion sort implementation
 template<typename T>
@@ -79,10 +78,10 @@ inline void insertion_sort(T* firstMove, T* lastMove)
         {
             p = d = cur;
             value = *p--;
-            if (value < *p)
+            if (*p < value)
             {
                 do *d = *p;
-                while (--d != firstMove && value < *--p);
+                while (--d != firstMove && *--p < value);
                 *d = value;
             }
         }
@@ -132,7 +131,7 @@ inline T pick_best(T* curMove, T* lastMove)
     bestMove = *curMove;
     while (++curMove != lastMove)
     {
-        if (*curMove < bestMove)
+        if (bestMove < *curMove)
         {
             tmp = *curMove;
             *curMove = bestMove;