Local Search (constraint Satisfaction) - Random Walk

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:

    And catch the gleaming of a random light,
    That tells me that the ship I seek is passing, passing.
    Paul Laurence Dunbar (1872–1906)

    I let my neighbor know beyond the hill;
    And on a day we meet to walk the line
    And set the wall between us once again.
    We keep the wall between us as we go.
    Robert Frost (1874–1963)