Ideal Distances in A* Search

Let f(s) represent the cost (distance) of a shortest path that starts at the start state, goes through s, and ends at a goal state.

Let g(s) represent the cost of a shortest path from the start state to s.

Let h(s) represent the cost of a shortest path from s to a goal state.

Then f(s) = g(s) + h(s)

During the search, the algorithm generally does not know the true values of these functions.

Previous slide

Next slide

Back to first slide

View graphic version