PlaySudoku.us
Evil · Puzzle #658
8
4
1
5
7
8
5
9
9
7
1
7
6
9
6
8
8
2
1
4
7
1
9
2
4
3
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