Addition Cryptarithm Workbench

How to use Addition Cryptarithm Workbench

Enter two to four addend words and a result word using ASCII letters. Optional fixed digit clues restrict the search. The solver visits decimal columns, enforces distinct digits and leading-zero rules, then returns checked assignments while preserving the exact node/witness stopping reason.

1. Use the example as the schema; replace its labels and entered model assumptions.
2. Enter two to four addend words and a result word using ASCII letters. Optional fixed digit clues restrict the search. The solver visits decimal columns, enforces distinct digits and leading-zero rules, then returns checked assignments while preserving the exact node/witness stopping reason.
3. Calculate, inspect the complete witnesses and limitations, then copy or download the JSON report.

Good to know

• At most 10 distinct letters, 12 letters per word, 4 addends, 10 fixed clues, 200,000 assignment trials and 20 returned witnesses. Only addition is supported. Exhaustion is required for a none/unique conclusion; one witness from a stopped search remains unknown for uniqueness. No arbitrary expressions or upstream solver code.
• Local calculation with no upload, input persistence or outside lookup. Model JSON is limited to 30,000 characters and 10,000 values. Decimal quantities are strings with up to six places; count fields use plain JSON integers. Exact fractions are capped at 8,192 bits. The complete JSON output is limited to 1,000,000 characters; approximate numbers preserve their stored values. Unsupported states fail explicitly.