concept path finding in category AI

appears as: Path finding
Grokking Artificial Intelligence Algorithms

This is an excerpt from Manning's book Grokking Artificial Intelligence Algorithms.

Uninformed search algorithms such as breadth-first search and depth-first search explore every possibility exhaustively and result in the optimal solution. A* search is a good approach when a sensible heuristic can be created to guide the search. It computes more efficiently than uninformed search algorithms, because it ignores nodes that cost more than nodes already visited. If the heuristic is flawed, however, and doesn’t make sense for the problem and context, poor solutions will be found instead of optimal ones.