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