Tech article
Solving a corn puzzle with CP-SAT
No preview is available. Read the original article for the full story.
Hacker News | Sep 27, 2026 | luu
Automated excerpt
If you ever get stuck and there are no legal moves left, undo your last move and try again from there. So for each of is true ($1$) if the piece is placed there, false ($0$) if it isn’t. Then for all spaces $s$ on the cob, So every piece is used once, and every spot is covered once.
Selected automatically from source text; not independently written or fact-checked. Read the original for full context.