This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Page 1 of 62 MCM 2008 Team #3780 Ease and Toil: Analyzing Sudoku February 18, 2008 Look at any current magazine, newspaper, computer game package or handheld gaming device and you likely find sudoku, the latest puzzle game sweeping the nation. Sudoku is a numberbased logic puzzle in which the numbers 1 through 9 are arranged in a 9 × 9 matrix, subject to the constraint that there are no repeated numbers in any row, column, or designated 3 × 3 square. In addition to being entertaining, sudoku promises valuable insight into computer sci ence and mathematical modeling. In particular, since sudoku solving is an NPComplete problem, algorithms to generate and solve sudoku puzzles may offer new approaches to a whole class of computational problems . Moreover, we can further explore mathematical modeling techniques through generating puzzles since sudoku construction is essentially an optimization problem. The purpose of this paper is to propose an algorithm that may be used to construct unique sudoku puzzles with four different levels of difficulty. We attempted to minimize the complexity of the algorithm while still maintaining separate difficulty levels and guar anteeing unique solutions. In order to accomplish our objectives, we developed metrics with which to analyze the difficulty of a given puzzle. By applying our metrics to published control puzzles with spe cific difficulty levels we were able to develop classification functions for specific difficulty ratings. We then used the functions we developed to ensure that our algorithm gener ated puzzles with difficulty levels analogous to those currently published. We also sought out to measure and reduce the computational complexity of the generation and metric measurement algorithms. Finally, we worked to analyze and reduce the complexity involved in generating puzzles while maintaining the ability to choose the difficulty of the puzzles generated. To do so, we implemented a profiler and performed statistical hypothesis testing to streamline the algorithm . Page 2 of 62 MCM 2008 Team #3780 Contents 1 Introduction 3 1.1 Statement of Problem . . . . . . . . . 3 1.2 Relevance of Sudoku . . . . . . . . . 3 1.3 Goals . . . . . . . . . . . . . . . . . . 3 1.4 Rules of Sudoku . . . . . . . . . . . . 3 1.5 Terminology and Notation . . . . . . 3 1.6 Indexing . . . . . . . . . . . . . . . . 4 1.7 Formal Rules of Sudoku . . . . . . . 5 1.8 Example Puzzles . . . . . . . . . . . 5 2 Background 5 2.1 Common Solving Techniques . . . . 5 2.1.1 Naked Pair . . . . . . . . . . 5 2.1.2 Naked Triplet . . . . . . . . . 5 2.1.3 Hidden Pair . . . . . . . . . . 6 2.1.4 Hidden Triplet . . . . . . . . . 6 2.1.5 MultiLine . . . . . . . . . . . 6 2.2 Previous Works . . . . . . . . . . . . 7 2.2.1 SudokuExplainer . . . . . . . 7 2.2.2 QQWing . . . . . . . . . . . . 7 2.2.3 GNOME Sudoku . . . . . . . 7 3 Metric Design 10 3.1 Overview . . . . . . . . . . . . . . . . 10 3.2 Assumptions . . . . . . . . . . . . . . 10 3.3 Mathematical Basis for WNEF...
View
Full
Document
This note was uploaded on 02/07/2011 for the course PHYS 101 taught by Professor Aster during the Spring '11 term at East Tennessee State University.
 Spring '11
 Aster
 Current

Click to edit the document details