A * search can use a heuristic function that estimates the cost from a node to a

Question:

• A * search can use a heuristic function that estimates the cost from a node to a goal. If graph is not pathological (see Proposition 3.2) and the heuristic is admissible, A * is guaranteed to find a lowest-cost path to a goal if one exists.

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: