MAZELAB

Explores as deep as possible along each branch before backtracking. Trades optimality for memory efficiency.

Explores all neighbors at the current depth before moving deeper. Guarantees the shortest path.

Two simultaneous searches from start and end, meeting in the middle. Dramatically reduces search space.