The A∗ algorithm is optimal when,
PYQ UGC NET 2022
The A∗ algorithm is optimal when,
- A.
It always finds the solution with the lowest total cost if the heuristic ' ℎ ' is admissible.
- B.
Always finds the solution with the highest total cost if the heuristic ' h ' is admissible.
- C.
Finds the solution with the lowest total cost if the heuristic ' ℎ ' is not admissible.
- D.
It always finds the solution with the highest total cost if the heuristic ' h ' is not admissible.
Attempted by 215 students.
Sign up free to check your answer
Sign up freeLoading lesson…

