PlaySudoku.us
Hard · Puzzle #174
8
3
6
8
7
3
9
5
5
2
8
7
9
6
2
1
3
6
9
5
7
4
2
3
3
9
5
4
2
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.
"Not all those who wander are lost." — J. R. R. Tolkien
"Not all those who wander are lost." — J. R. R. Tolkien