UGCNET-June2016-III: 72

1.4k views

How does randomized Hill climbing choose the next move each time?

1. It generates a random move from moveset and accepts this move
2. It generates random move from whole state space, and accepts this move
3. It generates a random move from moveset and accepts this move only if this move improves the evaluation function
4. It generates a random move from whole state space, and accepts this move only if this move improves the evaluation function
in Others
recategorized

It generates a random move from moveset and accepts this move only if this move improves the evaluation function

Randomized Hill Climbing: Sample p points randomly in the neighborhood of the currently

best solution; determine the best solution of the n sampled points. If it is better than the

current solution, make it the new current solution and continue the search; otherwise,

terminate returning the current solution.

selected

Related questions

1
2.2k views
Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state 1 2 3 which of the following state cannot be reached? A 3 1 2 B 3 2 1 C 1 3 2 D 2 1 3
Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning? $I$ $HI$ $CHI$ $GHI$