Solve an existing (addition) Cryptarithm or check a Cryptarithm formula to see if its pattern (that would be presented as Words) is unique. Green Flag. Choose the Mode: Solve - Solves an existing Cryptarithm. - Enter the Words that stand-in for the Addends. (empty input when finished entering Addends) - Enter The Word that stands-in for the Sum. Check - Finds all Addition formulas that match the pattern of the formula entered (to see if it is unique and can therefore be used in a Cryptarithm. - Enter the Numerical Digits of the Addends.
This uses a "Brute-Force" algorithm that tests every numerical combination. The greater the number of characters/digits in the Addends, the longer it takes. eg. DOG+CAT=PETS will take about 100 times longer than TO+GO=OUT. Therefore it's probably only practical for very simple formulas (6 TOTAL Addend digits). Try TurboWarp: https://turbowarp.org/1270535083 I will be optimizing it more if I can.
