We study how to simplify fractional factorial design generation by exploiting the a-priori knowledge that can be derived from the orthogonality constraints that the fractional factorial design itself must satisfy. We work on Sudoku puzzles that can be considered as a special case of Latin squares in the class of gerechte designs. We prove that the generation of a Sudoku is equivalent to that of a fraction of a proper set of permutations. We analyse both the 4x4 and the 9x9 Sudoku types.
Fractions of permutations. An application to Sudoku / Fontana R.. - In: JOURNAL OF STATISTICAL PLANNING AND INFERENCE. - ISSN 0378-3758. - STAMPA. - 141:12(2011), pp. 3697-3704. [10.1016/j.jspi.2011.06.001]
Titolo: | Fractions of permutations. An application to Sudoku. | |
Autori: | ||
Data di pubblicazione: | 2011 | |
Rivista: | ||
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.jspi.2011.06.001 | |
Appare nelle tipologie: | 1.1 Articolo in rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
JSPI4656 personal copy.pdf | personal copy | 2. Post-print / Author's Accepted Manuscript | Non Pubblico - Accesso privato/ristretto | Administrator Richiedi una copia |
http://hdl.handle.net/11583/2424124