Editing Verbal arithmetic (section)

==Other information==
When generalized to arbitrary bases, the problem of determining if a cryptarithm has a solution is [[NP-complete]].<ref>{{cite journal | author = David Eppstein | title = On the NP-completeness of cryptarithms | journal = SIGACT News | volume = 18 | issue = 3 | pages = 38–40 | year = 1987 | url = http://www.ics.uci.edu/~eppstein/pubs/Epp-SN-87.pdf | doi = 10.1145/24658.24662| s2cid = 2814715 | author-link = David Eppstein }}</ref> (The generalization is necessary for the hardness result because in base 10, there are only 10! possible assignments of digits to letters, and these can be checked against the puzzle in linear time.)

Alphametics can be combined with other number puzzles such as Sudoku and Kakuro to create cryptic [[Sudoku]] and [[Kakuro]].<!--NOT CLEAR HOW-->