T *cur, *p, *d;
if (firstMove != lastMove)
- for (cur = firstMove; ++cur != lastMove; )
+ for (cur = firstMove + 1; cur != lastMove; cur++)
{
p = d = cur;
value = *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 (*curMove < bestMove)
+ {
+ tmp = *curMove;
+ *curMove = bestMove;
+ bestMove = tmp;
+ }
+ }
+ return bestMove;
+}
+
////
//// Inline functions
////
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);
}