Having a bit of trouble doing research and trying to solve this problem in PROLOG. I have to implement a cryptarithmetic-puzzle solver able to solve any possible cryptarithmetic-puzzle. I'll explain in a bit more detail below.
Given as input a list which has a variable number of elements (at least 3), for example [send, more, money] which will be the equivalent of SEND+MORE=MONEY, implement a program that outputs appropriate messages. If there is a solution to the input the program will output a list of digits assigned to each character or the expression where each character is replaced with its' assigned digit.
I appreciate all answers, though I would appreciate a complete answer more. From my past experiences I have learned I understand things better if I see a full solution to something, so that I can follow it line by line and see what makes the solution tick.
This is a great classic.
Check out the solution based on CLP(FD) library(clpfd): CLP(FD): Constraint Logic Programming over Finite Domains
or the classic code on (randomly selected) this page, which also contains the CLP(FD) example, but using the ECLiPSe solver.