How does randomized Hill climbing choose the next move each time?
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.