Though local search algorithms are not systematic, key advantages would include
A. Less memory
B. More time
C. Finds a solution in large infinite space
D. No optimum solution
Answer:A
Though local search algorithms are not systematic, key advantages would include
A. Less memory B. More time C. Finds a solution in large infinite space D. No optimum solution
Explanation: Two advantages: (1) they use very little memory-usually a constant amount; and (2) they can often find reasonable solutions in large or infinite (continuous) state spaces for which systematic algorithms are unsuitable.