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, Roberto. - In: JOURNAL OF STATISTICAL PLANNING AND INFERENCE. - ISSN 0378-3758. - STAMPA. - 141:12(2011), pp. 3697-3704. [10.1016/j.jspi.2011.06.001]

Fractions of permutations. An application to Sudoku.

FONTANA, ROBERTO
2011

Abstract

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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2424124
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo