Breadth-first Search

We can solve this via BFS, but there's a problem...

\epsfig {file=l0502.ps,height=2in,angle=270}

minimizing actions does not always minimize driving time.

We can get around this by expanding the search deeper, but things start to get complex.


next up previous
Next: Dijkstra's Algorithm Up: Heuristic Search Previous: Path Problems