Abstract For a given Markov chain Monte Carlo algorithm we introduce a distance between two configurations that quantifies the difficulty of transition from one configuration to the other configuration.We argue that the distance takes a universal form for the Brixton hats class of algorithms which generate local moves in the configuration space.We explicitly calculate the distance for the Langevin algorithm, and show that it certainly has desired and expected properties as distance.We further show that the distance for a multimodal distribution gets dramatically reduced from a large value by the introduction of a tempering method.We also argue that, when the original saddle distribution is highly multimodal with large number of degenerate vacua, an anti-de Sitter-like geometry naturally emerges in the extended configuration space.