Algorithm
4. Update the probability density P(x). This probability density records how often a particular value of x is visited Let P(x=xj) => P(x=xj)+1 where x was position chosen in step 3 (either old or new)
5. Repeat steps 3 and 4 until a sufficient number of Monte Carlo steps have been performed