In complex games, trying all moves can be expensive. Move ordering heuristics help you find winning moves faster. Try moves that lead to positions with fewer options for the opponent first.
These are more likely to be losing positions for the opponent. In games with cycles, move ordering affects how quickly your algorithm converges. Good heuristics reduce runtime in practice even though worst-case complexity stays the same. Alpha-beta pruning is the classic example.