Question

When will Hill-Climbing algorithm terminate?

(a) Stopping criterion met

(b) Global Min/Max is achieved

(c) No neighbor has higher value

(d) All of the mentioned

The question was asked by my college professor while I was bunking the class.

I need to ask this question from Local Search Problems and Optimization Problems in division Problem Solving of Artificial Intelligence

Select the correct answer from above options

Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience

Answer 1

The correct option is (c) No neighbor has higher value

The best I can explain: When no neighbor is having higher value, algorithm terminates fetching local min/max.