3 ms·
I was pondering an extreme 'sudoku' with the fewest of possible starting numbers: one. Then I realized you could solve it by starting with any solved sudoku and
by karmakaze 5y ago
I was pondering an extreme 'sudoku' with the fewest of possible starting numbers: one. Then I realized you could solve it by starting with any solved sudoku and shuffling columns, rows, block-columns, and block-rows, in a manner similar to learning how a Rubik's cube works. That turned it into a vastly simpler deductive problem. I would say that this was creative but not irrational.
- Etheryte 5y agoJust a small side note, you can solve any such sudoku in the same way you can fill a blank sudoku grid with a valid game state. Take the first 3x3 square and fill it with consecutive numbers 1,2, ..., 9. Then take the next 3x3 square and fill it with 2, 3, ..., 9, 1. Do the same for each next square and you'll end up with a valid board. To solve the one-number-only sudoku you would then simply take the 3x3 square the number is in, fill it with consecutive numbers around the given number, and then fill the rest of the board similar to the above.
- karmakaze 5y agoNot much different. The advantage with using validity-preserving operations is that you can follow-up with more operations to satisfy additional constraints.