Depth-First Search
Strategy: always prefer the longest path
- exhaust a single node on the frontier before considering any of its siblings
Advantages
- space efficient: frontier grows only with d and not with b
- can find a long solution very quickly (if one chooses well)
Disadvantages
- can work on an arbitrary bad path for arbitrarily long
- prone to looping (exploring cycles in the graph)
- as a practical matter, incomplete
Possible solutions:
- loop detection
- depth limit