// An helper insertion sort implementation, works with pointers and iterators
template<typename T, typename K>
-inline void insertion_sort(K firstMove, K lastMove)
+inline void sort(K firstMove, K lastMove)
{
T value;
K cur, p, d;
}
}
-// Our dedicated sort in range [firstMove, lastMove), first splits
-// positive scores from ramining then order seaprately the two sets.
-template<typename T>
-inline void sort_moves(T* firstMove, T* lastMove, T** lastPositive)
-{
- 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 just positive scored moves, remaining only when we get there
- insertion_sort<T, T*>(firstMove, p);
- *lastPositive = 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 (bestMove < *curMove)
- {
- tmp = *curMove;
- *curMove = bestMove;
- bestMove = tmp;
- }
- }
- return bestMove;
-}
-
-
inline Square move_from(Move m) {
return Square((m >> 6) & 0x3F);
}
return Square(m & 0x3F);
}
-inline bool move_is_special(Move m) {
+inline bool is_special(Move m) {
return m & (3 << 14);
}
-inline bool move_is_promotion(Move m) {
+inline bool is_promotion(Move m) {
return (m & (3 << 14)) == (1 << 14);
}
-inline int move_is_ep(Move m) {
+inline int is_enpassant(Move m) {
return (m & (3 << 14)) == (2 << 14);
}
-inline int move_is_castle(Move m) {
+inline int is_castle(Move m) {
return (m & (3 << 14)) == (3 << 14);
}
-inline bool move_is_short_castle(Move m) {
- return move_is_castle(m) && (move_to(m) > move_from(m));
-}
-
-inline bool move_is_long_castle(Move m) {
- return move_is_castle(m) && (move_to(m) < move_from(m));
-}
-
-inline PieceType move_promotion_piece(Move m) {
+inline PieceType promotion_piece_type(Move m) {
return PieceType(((m >> 12) & 3) + 2);
}
}
inline Move make_promotion_move(Square from, Square to, PieceType promotion) {
- return Move(to | (from << 6) | ((promotion - 2) << 12) | (1 << 14));
+ return Move(to | (from << 6) | (1 << 14) | ((promotion - 2) << 12)) ;
}
-inline Move make_ep_move(Square from, Square to) {
+inline Move make_enpassant_move(Square from, Square to) {
return Move(to | (from << 6) | (2 << 14));
}
return Move(to | (from << 6) | (3 << 14));
}
-inline bool move_is_ok(Move m) {
+inline bool is_ok(Move m) {
return move_from(m) != move_to(m); // Catches also MOVE_NONE
}
extern const std::string move_to_uci(Move m, bool chess960);
extern Move move_from_uci(const Position& pos, const std::string& str);
extern const std::string move_to_san(Position& pos, Move m);
-extern const std::string pretty_pv(Position& pos, int depth, Value score, int time, Move pv[]);
#endif // !defined(MOVE_H_INCLUDED)