Timeline for Sudoku Puzzles in O log n time although inefficient
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 22, 2019 at 19:15 | comment | added | The T | Up to Infinity actually. But, showing it in concrete form is impossible. | |
| Apr 22, 2019 at 19:07 | comment | added | gnasher729 | @TravisWells You can obviously create a Sudoku with 16 rows, 16 columns, 16 boxes with numbers 1 to 16, 25 rows, 25 columns, 25 boxes with numbers 1 to 25 and so on. | |
| Apr 22, 2019 at 5:16 | comment | added | The T | @Dracoins n2xn2 as in what? 9x9 grids. all of them can be solved. All this time, I was misled that it was a np-hard problem. Now, I can create more constraint algorithms. Now, comes mario. | |
| Apr 22, 2019 at 3:34 | comment | added | Draconis | @TravisWells The sudoku problem isn't NP-hard: it can be solved in $O(1)$, as you have. The NP-hard problem is generalizing it to an $n^2 \times n^2$ grid with $n$ digits. This can be solved in exponential time with respect to $n$, and verified in polynomial time; the big question is whether it can be solved in polynomial time too. | |
| Apr 22, 2019 at 3:22 | comment | added | The T | Well, it seems algorithmic approaches to NP problems is impossible. If this is the closest they can get. | |
| Apr 22, 2019 at 3:17 | vote | accept | The T | ||
| Apr 22, 2019 at 3:15 | history | edited | D.W.♦ | CC BY-SA 4.0 |
added 24 characters in body
|
| Apr 22, 2019 at 3:11 | history | answered | D.W.♦ | CC BY-SA 4.0 |