Timeline for Can experienced players tell when a Sudoku was randomly generated? Or if it's a shuffled version?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 12, 2023 at 18:21 | vote | accept | bryc | ||
| Apr 10, 2023 at 17:32 | comment | added | Degustaf | @RosieF The puzzles that are one clever step and then it's easy are known as one-steppers, and are built as introductions to that technique. In my opinion, the distinction between human made and computer generated is that most random puzzles that are unique can be solved with very basic steps. Having a puzzle with severable interesting steps is tough to get at random. If the programmer is aware of these, and can build a generator that includes those sorts of techniques, it would be less likely to be spotted as computer generated. | |
| Apr 9, 2023 at 19:30 | comment | added | Rosie F | @codewarrior0 Now that deduction in that sudoku was definitely a more advanced one --- it entailed colouring (deducing that cells' values are equal before it's known what they are). And it needs so much space, two of it can't fit into a 9x9 sudoku. As to solve paths: a) This seems to be a sudoku with a clever break-in, after which the order of further deductions is irrelevant, so the solve-path is no more than 1) the clever bit 2) everything else. b) Why's a unique solve-path desirable? If it's solvable in an unintended way, isn't that bad for the setter, not the solver? | |
| Apr 9, 2023 at 9:31 | comment | added | codewarrior0 | I think his point was that Snyder's puzzle has (and human-set puzzles in general have) a definite solve path, an experience for the solver designed by the setter. I'm reminded of another puzzle featured on Cracking the Cryptic that deliberately leads the solver to an unnamed deduction. That kind of deduction would rarely if ever appear in a computer-set puzzle and it certainly wouldn't be intended by the setting algorithm. | |
| Apr 9, 2023 at 7:16 | comment | added | Rosie F | That forced aha in Thomas Snyder's sudoku was rot13(na kjvat) --- standard fare for a sudoku one notch above "easy". Are you saying that computers can't generate sudokus that are that hard? Or is the point that, in Thomas Snyder's sudoku, the hardest required technique was required only once, and computers can't generate sudokus with that feature? | |
| Apr 9, 2023 at 6:33 | history | answered | Deusovi♦ | CC BY-SA 4.0 |