The A∗ algorithm is optimal when,

PYQ UGC NET 2022

The A∗ algorithm is optimal when,

  1. A.

    It always finds the solution with the lowest total cost if the heuristic ' ℎ ' is admissible.

  2. B.

    Always finds the solution with the highest total cost if the heuristic ' h ' is admissible.

  3. C.

    Finds the solution with the lowest total cost if the heuristic ' ℎ ' is not admissible.

  4. 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 free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…