Why is the a * search heuristic optimal even if it underestimates costs?

Why is the A* search heuristic optimal even if it underestimates costs? A* search finds optimal solution to problems as long as the heuristic is admissible which means it never overestimates the cost of the path to the from any given node (and consistent but let us focus on being admissible at the moment).
For More Information Please Refer:


You May Also Like to Read: