Random Latin squares and Sudoku designs generation

2013/05/16 by Roberto Fontana, Fontana, Roberto · 1 citation
Computer Science · Engineering · Mathematics · #Computation (stat.CO) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #graph theory and CDMA systems #stat.CO

paper · pdf · doi:10.48550/arxiv.1305.3697

arxiv created 2013/05/16 · openalex publication_date 2013/05/16 · arxiv updated 2013/05/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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

• Random sampling of Latin squares via binary contingency tables and probabilistic divide-and-conquer

Related

• Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer
• On uniformly generating Latin squares
• Random sampling of Latin squares via binary contingency tables and probabilistic divide-and-conquer
• Generating graphs randomly
• Extremal and monotone behaviour of the Sudoku number and related critical set parameters