Translator Disclaimer
2014 Random Latin squares and Sudoku designs generation
Roberto Fontana
Electron. J. Statist. 8(1): 883-893 (2014). DOI: 10.1214/14-EJS913

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. The corresponding SAS code is available in the supplementary material.

Citation

Download Citation

Roberto Fontana. "Random Latin squares and Sudoku designs generation." Electron. J. Statist. 8 (1) 883 - 893, 2014. https://doi.org/10.1214/14-EJS913

Information

Published: 2014
First available in Project Euclid: 26 June 2014

zbMATH: 1348.62227
MathSciNet: MR3229101
Digital Object Identifier: 10.1214/14-EJS913

Subjects:
Primary: 62K15

Rights: Copyright © 2014 The Institute of Mathematical Statistics and the Bernoulli Society

JOURNAL ARTICLE
11 PAGES


SHARE
Vol.8 • No. 1 • 2014
Back to Top