Random Latin squares and Sudoku designs generation

Abstract

Uniform random generation of Latin squares is a classical problem. In this paper we prove that both Latin squares and Sudoku designs are maximum cliques of properly defined graphs. We have developed a simple algorithm for uniform random sampling of Latin squares and Sudoku designs. It makes use of recent tools for graph analysis. The corresponding SAS code is annexed.

Cited by in corpus (2)

• Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer
• Random sampling of Latin squares via binary contingency tables and probabilistic divide-and-conquer