Breadth-First Search
Strategy: always prefer the shortest path
- consider all solutions of length k before considering any solution of length k+1
-
Advantages
- complete: will always find a solution if there is one
-
Disadvantages
- memory intensive: frontier grows exponentially with b and d
- always takes exponential time to find long solutions