/sudoku — the metaphor made interactive
Composition is the deduction engine.
Sudoku is a constraint-satisfaction problem solvable in seconds because every move propagates. Codebases are constraint-satisfaction problems too. veric makes them solvable the same way.
phase 1 — sudoku
Click any empty cell.
Each click fills the correct digit. Watch the cell's row, column, and 3×3 box flash with their narrowed candidate sets.
cells filled
0 / 51
constraints propagated
0
search-space reduction
1