A* algorithm: combines best part of Greedy search, which explores a small number of nodes in many cases, and Uniform Cost Search, which is guaranteed to find the shortest path.

Overestimate: h(s) > true cost

When does Problem-Solving Technology work?

Like what you read? Give Trung Tran a round of applause.

From a quick cheer to a standing ovation, clap to show how much you enjoyed this story.