[–] gnabgib 6mo ago ↗ Some comments 2 months ago (15 points, 7 comments)2012 (28 points, 9 comments) https://news.ycombinator.com/item?id=44347442010 (65 points, 48 comments) https://news.ycombinator.com/item?id=1221399 [–] Jtsummers 6mo ago ↗ The one from a couple months ago is here: https://news.ycombinator.com/item?id=45733410
[–] Jtsummers 6mo ago ↗ The one from a couple months ago is here: https://news.ycombinator.com/item?id=45733410
[–] crustycoder 6mo ago ↗ Or perhaps just use a language that's designed to solve those sorts of problems? In 14 lines of code.https://www.swi-prolog.org/pldoc/man?section=clpfd-sudoku
[–] kayo_20211030 6mo ago ↗ Peter Seibel's original post is worth reading in its entirety.It's a decently balanced piece. It leaves room for various views, and its summation seems about right.https://gigamonkeys.wordpress.com/2009/10/05/coders-unit-tes...
[–] nurettin 6mo ago ↗ I remember implementing some of thesehttps://www.stolaf.edu/people/hansonr/sudoku/12rules.htmWith a simple array of unsigned int and bit operations like 20 years ago. It could solve a lot of puzzles within microseconds. Later I realized rules 1, 2, 5, 6 are pretty much the same.
5 comments
[ 2.5 ms ] story [ 27.5 ms ] thread2012 (28 points, 9 comments) https://news.ycombinator.com/item?id=4434744
2010 (65 points, 48 comments) https://news.ycombinator.com/item?id=1221399
https://www.swi-prolog.org/pldoc/man?section=clpfd-sudoku
It's a decently balanced piece. It leaves room for various views, and its summation seems about right.
https://gigamonkeys.wordpress.com/2009/10/05/coders-unit-tes...
https://www.stolaf.edu/people/hansonr/sudoku/12rules.htm
With a simple array of unsigned int and bit operations like 20 years ago. It could solve a lot of puzzles within microseconds. Later I realized rules 1, 2, 5, 6 are pretty much the same.