Search in Complex Environments

Question 1

What is the Hill-Climbing Search (aka Greedy Local Search)

Answer 1

Keep a single “current” state and try to find better neighboring states.

Question 2

What is Steepest-Ascent Hill Climbing Search?

Answer 2

Check all possible successors and choose the highest-valued successor

Question 3

What is Stochastic Hill-Climbing?

Answer 3

Choose randomly among all uphill moves, or generate randomly one new successor at a time until a better one is found (first-choice hill-climbing)