Optimi-Zi(n)g Sudoku-Solving
20 points
6 days ago
| 2 comments
| log.pfad.fr
| HN
taeric
3 days ago
[-]
Very fun read! My first try at implementing DLX was for sudoku, as well. I keep meaning to add something showing why it backtracked at a particular spot. Is fun watching the numbers it tries along the way.

And if you haven't seen it, Knuth has a whole section on puzzles in his newer writings. Always fun to flip through.

(If you want to see the numbers fill up, I have that at https://taeric.github.io/Sudoku.html)

reply
mcphage
3 days ago
[-]
> Knuth has a whole section on puzzles in his newer writings

That sounds really interesting—can you share which book / fascicle / article that's at?

reply
taeric
3 days ago
[-]
Parts of https://www.informit.com/store/art-of-computer-programming-v... are covering DLX and friends, if I have the link correct. (Linking to his publisher's page, as I think that is his preference.)

On his homepage, he also links "A Potpourri of Puzzles" at https://cs.stanford.edu/~knuth/fasc9b.ps.gz.

reply
mcphage
3 days ago
[-]
Thank you!
reply
fchief
3 days ago
[-]
Well done! I used to play Sudoko daily, but have switched to KENKEN, and I think a similar approach would work well.
reply