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

Question:

• A∗ search can use a heuristic function that estimates the cost from a node to a goal. If this estimate underestimates the actual cost, A∗ is guaranteed to find a least-cost path first.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

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