The orange box is the step that just happened; the pale orange boxes are the path that led to it. The small numbers count how often each box has been visited.
Click anywhere on the curve to choose the starting solution. A neighbour is x moved left or right by 1 to 10 steps.
Left: the chance of accepting a worse move, P = e−δ/T, for every size of worsening δ. The dashed curve is at the start (T0), the solid one at the current T. Right: the random number r is drawn on the 0–1 bar. Below P (green) → accept; above P (red) → reject.
T is multiplied by α after every iters_per_T moves, until it falls below T_min. What "hot" means depends on δ (see “How hot is hot?”). The bands use a typical worsening δ: HOT = it is accepted more than half the time, WARM = sometimes, COLD = less than 2 times in 100.
| # | T | f(x) | move | f(x′) | δ | P | r | result | new f(x) |
|---|
Shows the latest 150 proposals. '–' in P and r: the move was not worse, so no random draw was needed.
Fast cooling (α = 0.90) is a quench: few temperature levels, so the search freezes in the first valley it falls into. Slow cooling spends many more evaluations and usually ends lower. Press the button to see it.