A Clash Course in Solving Sudoku (functional Pearl) [pdf]
Posted4 months agoActive4 months ago
unsafeperform.ioTechstory
calmmixed
Debate
20/100
Functional ProgrammingSudoku SolvingClash
Key topics
Functional Programming
Sudoku Solving
Clash
The story shares a research paper on using Clash, a functional programming language, to solve Sudoku puzzles, with the discussion revolving around alternative, more efficient methods to solve Sudoku.
Snapshot generated from the HN discussion
Discussion Activity
Light discussionFirst comment
2d
Peak period
1
54-60h
Avg / period
1
Key moments
- 01Story posted
Aug 21, 2025 at 6:55 PM EDT
4 months ago
Step 01 - 02First comment
Aug 24, 2025 at 5:41 AM EDT
2d after posting
Step 02 - 03Peak activity
1 comments in 54-60h
Hottest window of the conversation
Step 03 - 04Latest activity
Aug 24, 2025 at 2:12 PM EDT
4 months ago
Step 04
Generating AI Summary...
Analyzing up to 500 comments to identify key contributors and discussion patterns
Discussion (2 comments)
Showing 2 comments
fjfaase
4 months ago
1 replyThe easiest way to solve a sudoku is to map it to an exact cover problem and then apply an exact cover solver, which for sudokus that have one solution is equal to finding colums that are a strict superset of another column and removing the rows that have a 1 in the superset and a 0 in the other column. You need far less code for describing this than the code presented in the article.
munchler
4 months ago
The article isn’t about solving Sudoku, though. It’s about using functional programming to design hardware. Sudoku is only used as an example.
View full discussion on Hacker News
ID: 44979136Type: storyLast synced: 11/20/2025, 11:47:20 AM
Want the full context?
Jump to the original sources
Read the primary article or dive into the live Hacker News thread when you're ready.