Paper detail

On uniformly generating Latin squares

By simulating an ergodic Markov chain whose stationary distribution is uniform over the space of nxn Latin squares, Mark T. Jacobson and Peter Matthews [4], have discussed elegant methods by which they generate Latin squares with a uniform distribution (approximately). The central issue is the construction of "moves" that connect the squares. Most of their lengthy paper is to prove that the associated graph is indeed connected. We give a short proof of this fact by using the concepts of Latin bitrades.