Implement random walk, as a reference - in each iteration performs a randomly selected move (regardless of its evaluation) and returns the best solution thus found solution thus found.
Important: This algorithm should run in the same amount of time as the slowest of the average
version of the local search.
Implement random walk, as a reference - in each iteration performs a randomly selected move (regardless of its evaluation) and returns the best solution thus found solution thus found.
Important: This algorithm should run in the same amount of time as the slowest of the average version of the local search.