Question

Which of the following algorithms is/are guaranteed to give an optimal solution?

Greedy Best First Search


A* with zero heuristic


A* with consistent heuristic


Depth First Search​

Answer 1

Q)  Which of the following algorithms is/are guaranteed to give an optimal solution?

a) Greedy Best First Search

b) A* with zero heuristic

c) A* with consistent heuristic

d) Depth First Search​

Option (c) A* with a consistent heuristic algorithm gives an optimal solution.

• When an algorithm gives the best solution for any problem with less time than any other algorithm then it is said that the particular algorithm is optimal.
• A* algorithm also belongs to the search algorithm category.
• When the shortest and smallest path needs to find out between the starting and ending points, then this A* algorithm is used.
• The heuristics helps to decide which path to be followed based on the data available.
• When the heuristic related to the A* algorithm is consistent and admissable that algorithm gives an optimal solution.

#SPJ3