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 4×4 and the 9×9 Sudoku types.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
