3
5
7
1
2
5
1
8
4
1
2
5
4
9
1
3
2
8
3
5
6
1
3
9
8
7
1
2
5
1
8
7
There are Sudoku variants with extra constraints: Killer Sudoku (cage sums), Diagonal Sudoku, and even 3D Sudoku.
There are Sudoku variants with extra constraints: Killer Sudoku (cage sums), Diagonal Sudoku, and even 3D Sudoku.
The P vs. NP problem — the biggest open question in computer science — would be impacted if Sudoku generalizations could be solved in polynomial time.
The P vs. NP problem — the biggest open question in computer science — would be impacted if Sudoku generalizations could be solved in polynomial time.