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)
“When you take a light perspective, it’s easier to step back and relax when your child doesn’t walk until fifteen months, . . . is not interested in playing ball, wants to be a cheerleader, doesn’t want to be a cheerleader, has clothes strewn in the bedroom, has difficulty making friends, hates piano lessons, is awkward and shy, reads books while you are driving through the Grand Canyon, gets caught shoplifting, flunks Spanish, has orange and purple hair, or is lesbian or gay.”
—Charlotte Davis Kasl (20th century)