We want to find the shortest path to a destination in grid world.
We have to process many possible paths.
We keep a record of the best path to any grid square we have
processed.
We estimate the cost to the goal from each grid square that we
visit.
We only need to process each grid square once.
We do not need to process all grid squares.
Link to this comment:
All Comments (0)