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:
“poor Felix Randal;
How far from then forethought of, all thy more boisterous years,
When thou at the random grim forge, powerful amidst peers,
Didst fettle for the great gray drayhorse his bright and battering
sandal!”
—Gerard Manley Hopkins (1844–1889)
“You can make lots of mistakes, but if you give children avenues for creativity and joy, they will have resources to carry them through. For example, if cooking together, reading, listening to music, coloring, participating in sports, or taking a walk in the woods are paired with pleasure and closeness, throughout life doing these things will kindle old feelings of happiness an/or comfort.”
—Charlotte Davis Kasl (20th century)