WebMath: Heuristics for cryptarithm solution

[Goldberg Felix]

Dear Ladies and Gentlemen,
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, not with brute force, but rather using
heuristics 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?

Thanks in advance,
Felix Goldberg.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: https://mail.cms.math.ca/pipermail/webmath/attachments/20000218/944ddc72/attachment.htm