Simple criteria for convergence of Monte Carlo algorithms not necessarily requiring detailed balance for any
specified transition probability are derived and it is shown that it is possible to view the algorithm as a
superimposition of a Brownian motion on configurational space coupled to the transition prob- abilities.