What happens as we vary heuristic quality?
- As a thought experiment, let's consider a grid of points and s
and t on the same line.
- Let all nodes be completely connected and w be Euclidean
distance.
- Let
, so c = 0 is Dijkstra and c=1 is
the perfect heuristic. - Which nodes are searched as a function of c? Try 0, 1, 1/2.
Next: Homework 11: Final (incomplete)
Up: A
Previous: Generating Heuristics