Methodology

At each step this algorithm probabilistically decides whether or 
not to take a greedy step (change to the best neighbour) or to take
a random walk (change to any neighbour)

Options

You may choose between a one or two stage heuristic. In the first 
case the variable and value are chosen together in the second the 
variable is chosen first and then the value.

To increase the random walk percentage increase the "random ..." values.
