int score;
};
-// Note that operator< is set up such that std::stable_sort() will sort in descending order
+// Note that operator< is set up such that std::sort() will sort in descending order
inline bool operator<(const MoveStack& f, const MoveStack& s) { return s.score < f.score; }
case PH_GOOD_CAPTURES:
lastMove = generate_captures(pos, moves);
score_captures();
- std::stable_sort(moves, lastMove);
+ std::sort(moves, lastMove);
return;
case PH_KILLERS:
case PH_NONCAPTURES:
lastMove = generate_noncaptures(pos, moves);
score_noncaptures();
- std::stable_sort(moves, lastMove);
+ std::sort(moves, lastMove);
return;
case PH_BAD_CAPTURES:
// to get SEE move ordering.
curMove = badCaptures;
lastMove = lastBadCapture;
- std::stable_sort(badCaptures, lastMove);
+ std::sort(badCaptures, lastMove);
return;
case PH_EVASIONS:
assert(pos.is_check());
lastMove = generate_evasions(pos, moves, pinned);
score_evasions();
- std::stable_sort(moves, lastMove);
+ std::sort(moves, lastMove);
return;
case PH_QCAPTURES:
lastMove = generate_captures(pos, moves);
score_captures();
- std::stable_sort(moves, lastMove);
+ std::sort(moves, lastMove);
return;
case PH_QCHECKS:
for (Options::const_iterator it = options.begin(); it != options.end(); ++it)
vec.push_back(it->second);
- std::stable_sort(vec.begin(), vec.end());
+ std::sort(vec.begin(), vec.end());
for (std::vector<Option>::const_iterator it = vec.begin(); it != vec.end(); ++it)
{