Moves are shuffled in Negamax and IterativeSearch, which is useful in practice. However, this behavior should be configurable rather than enforced. In some cases, preserving the move generator order can be valuable, and shuffling should ideally be an option (possibly even the default, depending on the use case).

ParallelSearch does not currently apply shuffling, but it should support it as well. In practice, move generation order (especially with bitboard-based generators) often starts with weaker moves, so shuffling can improve overall search behavior by reducing bias from the generator order.