PlaySudoku.us
Medium · Puzzle #457
4
6
1
3
2
1
8
9
9
4
1
5
1
3
9
9
4
6
4
1
3
2
4
6
8
6
5
9
4
3
2
7
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.
"In the confrontation between the stream and the rock, the stream always wins — not through strength, but through persistence." — Buddha
"In the confrontation between the stream and the rock, the stream always wins — not through strength, but through persistence." — Buddha