The new technique propagated widely, along with the growing number of computers on which it could run. Refinements were made, especially the so-called Metropolis algorithm (later the Metropolis-Hastings algorithm) that made Monte Carlo even more effective by favoring more probable histories from the start. “The most important property of the algorithm is … that deviations from the canonical distribution die away,” explains Marshall Rosenbluth, who helped invent it. “Hence the computation converges on the right answer! I recall being quite excited when I was able to prove this.”
