[amp_mcq option1=”Best-first search” option2=”Greedy best-first search” option3=”A* search” option4=”None of the mentioned” correct=”option3″]
The correct answer is C. A* search.
A search is an informed search algorithm that uses a heuristic function to estimate the cost of reaching the goal from a given node. This allows A to expand the nodes that are most likely to be on the shortest path to the goal, which makes it more efficient than other search algorithms.
Best-first search is a general-purpose search algorithm that expands the node with the lowest estimated cost. This can be inefficient if the heuristic function is not accurate, as it may expand nodes that are not on the shortest path to the goal.
Greedy best-first search is a special case of best-first search that always expands the node with the lowest estimated cost, regardless of whether it is on the shortest path to the goal. This can be very inefficient, as it may expand many nodes that are not on the shortest path.
None of the mentioned is not a correct answer.