Question

Which of the following is the best example of the hill-climbing heuristic?
a. You try to figure out what courses you'll take next semester by obtaining an overview of the initial state; this perspective is similar to the overview from the top of a hill.
b. You want to become a social worker, so at each choice point, you choose the option that appears to lead most directly toward your goal.
c. You divide the problem into an orderly series of "hills," each of which must be surmounted before you move forward.
d. You realize that you must sometimes move backwards (returning to a previous "hill"), in order to move forwards to a solution.

Answer 1

Answer:

Correct Answer:

b. You want to become a social worker, so at each choice point, you choose the option that appears to lead most directly toward your goal.

Explanation:

Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing elevation/value to find the peak of the mountain or best solution to the problem. It terminates when it reaches a peak value where no neighbor has a higher value.