Sudoku Solver
Continuous superposition + orthogonal projection on a Cl(6) eigenstate basis. Same compiler scales N = 4 → 25 (any perfect square).
100% extreme 9×9 @ 30.6 ms — beats Kona 96.2% @ 313 ms / 36.5M params. Zero training.
grid size
paste puzzle
curated
substrate-native — no search, no annealing
Why this works
Each empty cell is a continuous superposition over the N digit-eigenstates of Cl(6). Row / column / box constraints become Gram-Schmidt projections — naked-singles, hidden-singles, locked candidates, naked pairs, X-wing all collapse out of the same operator at different scopes. No WalkSAT, no annealing, no discrete flips. When projection plateaus we branch on the most-constrained cell and recurse with bounded depth. Pure geometric collapse.