Meet the Sudoku puzzle
- Puzzle is NxN grid, with
some cells “given”
- Permute 1..N in each
“group” (row, col, block)
– Each cell part of three different permutations
- Place all numbers using
logic (no guessing)
– prove where numbers cannot (or must) go
1 2 3 4 5 6 7 8 9 A 4 3 2 5 1 B 8 1 9 4 5 C 2 1 8 7 3 9 D 5 E 6 1 3 F 2 G 4 7 5 3 6 9 1 2 8 H 9 7 I 3 1 6
NP‐complete => logic to solve a given puzzle can be arbitrarily complex, but verification is O(N)
“Broken” puzzle: 6 cannot appear twice in column 5