FIG. 1.

F(m, σ²) = N′, where N′ is the number of trial moves that maximizes $N\cdot ⟨P_{N,accept}⟩$. m and σ² are expressed in k_BT and (k_BT)², respectively. In this plot, N′ ranges from 1 to 12. For smaller values of m and larger values of σ², we can improve the sampling with multiple simultaneous trial moves. The dark blue region is where a single trial move is the most efficient choice.