Generalization of Metropolis – Hasting Algorithm

This paper presents Metropolis to search the space of possible configurations, by exploring possible transitions between configurations. The way the Metropolis algorithm decides about moving from the current state to a state in the neighborhood can be seen as a two-stage process. a probability that depends upon the relative costs of the solutions associated with two states. The Metropolis algorithm as the proposal stage will choose a neighbor uniformly at random. the Hasting Algorithm chain has the same stationary distribution as the usual Metropolis algorithm.