Groups
Bidirectional BFS searches forward from the start and backward from the goal to meet in the middle, drastically reducing explored states.
Meet-in-the-middle splits a hard exponential search into two halves, enumerates each half, and then combines results efficiently.