Mentor/s
Bernadette Boyle
Abstract
This paper explores the ”Minimum Sudoku Problem,” that says there must be at least 17 clues in order for a Sudoku Board to have a unique solution. We prove uniqueness up to seven clues for 9x9 boards. We also take a look at the different patterns of 4x4 boards, and how graph theory and the coloring of a graph relates to solving a Sudoku puzzle.
College and Major available
Mathematics
Location
Panel B: UC 107
Start Day/Time
4-21-2017 12:30 PM
End Day/Time
4-21-2017 1:45 PM
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 License.
An Exploration of the Minimum Clue Sudoku Problem
Panel B: UC 107
This paper explores the ”Minimum Sudoku Problem,” that says there must be at least 17 clues in order for a Sudoku Board to have a unique solution. We prove uniqueness up to seven clues for 9x9 boards. We also take a look at the different patterns of 4x4 boards, and how graph theory and the coloring of a graph relates to solving a Sudoku puzzle.
