Random Walk
A random walk algorithm sometimes moves like a greedy algorithm but sometimes moves randomly. It depends on a parameter, which is a real number between 0 and 1. At every move, with probability the algorithm proceeds like a greedy algorithm, trying to maximally decrease the cost of the assignment. With probability, however, the solution is changed in some other way, which involves some degree of randomness.
Read more about this topic: Local Search (constraint Satisfaction)
Famous quotes containing the words random and/or walk:
“It is a secret from nobody that the famous random event is most likely to arise from those parts of the world where the old adage “There is no alternative to victory” retains a high degree of plausibility.”
—Hannah Arendt (1906–1975)
“Freeing hostages is like putting up a stage set, which you do with the captors, agreeing on each piece as you slowly put it together; then you leave an exit through which both the captor and the captive can walk with sincerity and dignity.”
—Terry Waite (b. 1939)