/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2009 Marco Costalba
+ Copyright (C) 2008-2010 Marco Costalba, Joona Kiiski, Tord Romstad
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
}
}
-// Our dedicated sort in range [firstMove, lastMove), it is well
-// tuned for non-captures where we have a lot of zero scored moves.
+// 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)
+inline void sort_moves(T* firstMove, T* lastMove, T** lastPositive)
{
T tmp;
T *p, *d;
// Split positives vs non-positives
do {
- while ((++p)->score > 0);
+ while ((++p)->score > 0) {}
if (p != d)
{
- while (--d != p && d->score <= 0);
+ while (--d != p && d->score <= 0) {}
tmp = *p;
*p = *d;
} while (p != d);
- // Sort positives
+ // Sort just positive scored moves, remaining only when we get there
insertion_sort<T>(firstMove, p);
-
- 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);
+ *lastPositive = p;
}
// Picks up the best move in range [curMove, lastMove), one per cycle.
//// Prototypes
////
-extern std::ostream& operator<<(std::ostream &os, Move m);
-extern Move move_from_string(const Position &pos, const std::string &str);
-extern const std::string move_to_string(Move m);
+extern std::ostream& operator<<(std::ostream& os, Move m);
+extern Move move_from_string(const Position& pos, const std::string &str);
+extern const std::string move_to_string(Move m, bool chess960);
extern bool move_is_ok(Move m);