Dictionary:Drunkard’s walk

{{#category_index:D|drunkard’s walk}} A simulated annealing algorithm to find an optimum in model space by sometimes taking steps in random fashion but gradually biasing the walk by taking more steps in the ‘‘uphill’’ direction (assuming a maximum is sought).