Explanation: When no neighbor is having higher value, algorithm terminates fetching local min/max. 6. One of the main cons of hill-climbing search is,
A. Terminates at local optimum
B. Terminates at global optimum
C. Does not find optimum solution
D. Fail to find a solution
Answer:A
Explanation: When no neighbor is having higher value, algorithm terminates fetching local min/max. 6. One of the main cons of hill-climbing search is,
A. Terminates at local optimum B. Terminates at global optimum C. Does not find optimum solution D. Fail to find a solution
Explanation: Algorithm terminates at local optimum values, hence fails to find optimum solution. 7. Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move.