recategorized by
2,298 views
3 votes
3 votes

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
recategorized by

1 Answer

Best answer
5 votes
5 votes

ans is C  

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 by
Answer:

Related questions

3 votes
3 votes
2 answers
1
go_editor asked Aug 21, 2016
3,277 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 12 3which of the following state cann...
2 votes
2 votes
3 answers
2
Abdul Majeed asked Jul 11, 2016
5,166 views
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$$CH...