LM16-Local Search and Optimization-Hill Climbing-_Simulated Annealing

5 flashcards · Computer Science · by Ramya Santhi Ramachandran

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

   True

2. _______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.

   Hill-Climbing

3. What are the main cons of hill-climbing search?

   Terminates at local optimum & Does not find optimum solution

4. Hill-Climbing approach stuck for which of the following reasons?

   a) Local maxima b) Ridges c) Plateaux

5. ___________ algorithm keeps track of k states rather than just one.

   Local Beam search