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)
“All the morning we had heard the sea roar on the eastern shore, which was several miles distant.... It was a very inspiriting sound to walk by, filling the whole air, that of the sea dashing against the land, heard several miles inland. Instead of having a dog to growl before your door, to have an Atlantic Ocean to growl for a whole Cape!”
—Henry David Thoreau (1817–1862)