PlaySudoku.us
Evil · Puzzle #542
2
8
4
1
4
7
5
6
3
2
2
6
4
9
4
3
3
1
8
5
3
2
4
6
1
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.
"Our greatest glory is not in never falling, but in rising every time we fall." — Confucius
"Our greatest glory is not in never falling, but in rising every time we fall." — Confucius