The author writes an AArch64 assembly Sudoku solver for macOS, completing a series that explores solvers across different paradigms—from Agda with correctness proofs to raw assembly with zero safety nets. The ~200-line code leverages direct CPU instructions for bit-twiddling operations like popcount and candidate mask search, demonstrating that assembly can actually gain some abstractions by using the machine stack directly.
Background
This is part of Veit Heller's "Simple Sudoku Solvers" blog series exploring constraint-solving across different paradigms—from proof assistants to assembly. The series has covered Agda, Common Lisp, and Forth previously.
- Source
- Lobsters
- Published
- Oct 26, 2026 at 09:28 PM
- Score
- 5.0 / 10