A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal.

🎲 Try a Random Question  |  Total Questions in Quiz: 93  |  🧠 Study this quiz with Flashcards
This question is part of a full practice quiz:
Artificial Intelligence Practice Test Questions: Problem Solving — practice the complete quiz, review flashcards, or try a random question.

Topics include: Problem Solving, Uninformed Search Strategy, Uninformed Search and Exploration, Informed Search Strategy, Informed Search and Exploration, Local Search Problems and Optimization Problems, & Constraints Satisfaction Problems.

 


A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal.