3
4
4
8
1
5
3
9
2
5
8
7
4
1
9
3
7
6
3
8
1
4
9
2
1
8
4
3
8
4
9
5
9
7
3
2
"Perfection is not attainable, but if we chase perfection we can catch excellence." — Vince Lombardi
"Perfection is not attainable, but if we chase perfection we can catch excellence." — Vince Lombardi
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.