// An insertion sort, which sorts moves in descending order up to and including a given limit.
// The order of moves smaller than the limit is left unspecified.
// To keep the implementation simple, *begin is always included in the list of sorted moves.
// An insertion sort, which sorts moves in descending order up to and including a given limit.
// The order of moves smaller than the limit is left unspecified.
// To keep the implementation simple, *begin is always included in the list of sorted moves.