Sudoku solving algorithms
A standard Sudoku contains 81 cells, in a 9×9 grid, and has 9 boxes, each box being the intersection of the first, middle, or last 3 rows, and the first, middle, or last 3 columns. Each cell may contain a number from one to nine, and each number can only occur once in each row, column, and box. A Sudoku starts with some cells containing numbers (clues), and the goal is to solve the remaining cells. Proper Sudokus have one solution. Players and investigators use a wide range of computer algorithms to solve Sudokus, study their properties, and make new puzzles, including Sudokus with interesting symmetries and other properties.
- Comment
- enA standard Sudoku contains 81 cells, in a 9×9 grid, and has 9 boxes, each box being the intersection of the first, middle, or last 3 rows, and the first, middle, or last 3 columns. Each cell may contain a number from one to nine, and each number can only occur once in each row, column, and box. A Sudoku starts with some cells containing numbers (clues), and the goal is to solve the remaining cells. Proper Sudokus have one solution. Players and investigators use a wide range of computer algorithms to solve Sudokus, study their properties, and make new puzzles, including Sudokus with interesting symmetries and other properties.
- Depiction
- Has abstract
- enA standard Sudoku contains 81 cells, in a 9×9 grid, and has 9 boxes, each box being the intersection of the first, middle, or last 3 rows, and the first, middle, or last 3 columns. Each cell may contain a number from one to nine, and each number can only occur once in each row, column, and box. A Sudoku starts with some cells containing numbers (clues), and the goal is to solve the remaining cells. Proper Sudokus have one solution. Players and investigators use a wide range of computer algorithms to solve Sudokus, study their properties, and make new puzzles, including Sudokus with interesting symmetries and other properties. There are several computer algorithms that will solve 9×9 puzzles (n=9) in fractions of a second, but combinatorial explosion occurs as n increases, creating limits to the properties of Sudokus that can be constructed, analyzed, and solved as n increases.
- Is primary topic of
- Sudoku solving algorithms
- Label
- enSudoku solving algorithms
- Link from a Wikipage to an external page
- www.ams.org/notices/200904/rtx090400460p.pdf
- gsf.cococlyde.org/download/sudoku
- diuf.unifr.ch/pai/people/juillera/Sudoku/Sudoku.html
- Link from a Wikipage to another Wikipage
- Backtracking
- Bijection
- Breadth-first search
- Brute force search
- Category:Abstract strategy games
- Category:Search algorithms
- Category:Sudoku
- Combinatorial explosion
- Composition of relations
- Constraint satisfaction problem
- Dancing Links
- Degree of difficulty
- Depth-first search
- Exact cover
- File:Sudoku Puzzle by L2G-20050714 standardized layout.svg
- File:Sudoku puzzle hard for brute force.svg
- File:Sudoku solved by bactracking.gif
- Function (mathematics)
- Genetic algorithm
- Glossary of Sudoku
- Hitting set
- Index set
- Integer linear programming
- Knuth's Algorithm X
- Mathematics of Sudoku
- Partial function
- Partial permutation
- Permutation
- Restriction (mathematics)
- Set complement
- Simplex algorithm
- Simulated annealing
- Sudoku
- Tabu search
- SameAs
- 2ZfK4
- Algoritmo de sudoku
- Algoritmos para la resolución de sudokus
- m.0273ncg
- Q2756506
- Sudoku solving algorithms
- Алгоритми за решавање судокуа
- الگوریتمهای حل سودوکو
- Subject
- Category:Abstract strategy games
- Category:Search algorithms
- Category:Sudoku
- Thumbnail
- WasDerivedFrom
- Sudoku solving algorithms?oldid=1122259077&ns=0
- WikiPageLength
- 15331
- Wikipage page ID
- 8444301
- Wikipage revision ID
- 1122259077
- WikiPageUsesTemplate
- Template:Anchor
- Template:Citation needed
- Template:Failed verification
- Template:Main article
- Template:Mvar
- Template:Reflist
- Template:Section link
- Template:Short description
