WebMath: Heuristics for cryptarithm solution

[David K Smith]

Have you looked at Steven Kahan's three books?
Have some sums to solve
At Last! Encoded totals, second addition.
Take a look at a good book

where

Have+ some +sums +to =solve
At+ Last!+ Encoded+ totals,+ second= addition.
Take+ a +look+ at+ a+ good= book

which present such problems and discuss their solution.
available from Baywood http://baywood.com

David Smith
Dr David K Smith, School of Mathematical Sciences, University of Exeter,
Exeter, Devon, UK
email:D.K.Smith at exeter.ac.uk
My homepage has now moved to:
http://www.maths.ex.ac.uk/staff/DKSmith/HomePage.html
I imagine that were we to meet, we would disagree on many points. However, I
like to think that we would be united in what matters – a love for God, a
respect for truth and a passion for words. You were indeed a remarkable
pilgrim. (Terry Waite, in his Millennium Letter to John Bunyan)


  -----Original Message-----
  From: owner-webmath at camel.math.ca [mailto:owner-webmath at camel.math.ca]On
Behalf Of Goldberg Felix
  Sent: 18 February 2000 18:15
  To: cti-maths at mailbase.ac.uk; webmath at camel.math.ca
  Subject: WebMath: Heuristics for cryptarithm solution


  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/20000221/5799e049/attachment.htm