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:
“Novels as dull as dishwater, with the grease of random sentiments floating on top.”
—Italo Calvino (1923–1985)
“I am astonished at the singular pertinacity and endurance of our lives. The miracle is, that what is is, when it is so difficult, if not impossible, for anything else to be; that we walk on in our particular paths so far, before we fall on death and fate, merely because we must walk in some path; that every man can get a living, and so few can do anything more. So much only can I accomplish ere health and strength are gone, and yet this suffices.”
—Henry David Thoreau (1817–1862)