What local search algorithm is described by the following?

• The best move is not chosen instead a random one is chosen.
• If the move actually results better, it is always executed.
• Otherwise, the algorithm takes the move with a probability of less than 1.