X-Git-Url: https://git.sesse.net/?p=stockfish;a=blobdiff_plain;f=src%2Fmove.h;h=4e86a68908f6e2a68bb31254935426e3e3e4327f;hp=2ba0884087422d7bdd908d1130d3b19ed3a02486;hb=2f01d67a925e01508b4f3ae3bdc1c44d14b85c8e;hpb=4dd7fccfd18a809cf1e3b589c2ec77f4b386dad6

diff --git a/src/move.h b/src/move.h
index 2ba08840..4e86a689 100644
--- a/src/move.h
+++ b/src/move.h
@@ -86,6 +86,27 @@ inline void sort_moves(T* firstMove, T* lastMove)
         }
 }
 
+// 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 (*curMove < bestMove)
+        {
+            tmp = *curMove;
+            *curMove = bestMove;
+            bestMove = tmp;
+        }
+    }
+    return bestMove;
+}
+
 ////
 //// Inline functions
 ////
@@ -102,6 +123,10 @@ inline PieceType move_promotion_piece(Move m) {
   return PieceType((int(m) >> 12) & 7);
 }
 
+inline int move_is_special(Move m) {
+  return m & (0x1F << 12);
+}
+
 inline int move_is_promotion(Move m) {
   return m & (7 << 12);
 }