<HTML>
Dear Ladies and Gentlemen,
<BR>I am currently working on a project in Prolog that is to solve multiplication
cryptarithms. Of course, in the normal case when different letters
represent different digits and vice versa, the solution may be obtained
quickly by simple brute force search. However, the idea of the project
is to solve the cryptarithm in more or less the way a human being would,
that is, <I>not</I> with brute force, but rather using <I>heuristics</I>
derived from humans experience. Could anybody be so kind as to point
out to me some existing work in the field and/or some useful references?
<P>Thanks in advance,
<BR>Felix Goldberg.</HTML>