Question

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum.

(a) True

(b) False

This question was addressed to me in an online quiz.

My question is based upon Local Search Problems and Optimization Problems in section Problem Solving of Artificial Intelligence

Answer 1

Right answer is (a) True

To elaborate: An algorithm is complete if it finds a solution if exists and optimal if finds optimal goal (minimum or maximum).