Constraint Satisfaction Problem

Cryptarithmetic Solver & Sandbox

Assign a unique digit (0-9) to each letter with no leading zeros. Solved via column-wise CSP constraint propagation with carry tracking and real-time interactive sandbox mode.

GitHub Repository
Benchmark Presets Classic CSP Puzzles
Unique letters in equation:
Solver Output
Enter an equation and click Solve to run the CSP engine.