WebMath: Heuristics for cryptarithm solution
Monty Coward
m.coward at react.org.uk
Mon Feb 21 03:37:48 EST 2000
Greetings,
I think that there is some work being done on it at the University of
Paderborn, in Germany. I cannot recall if this is the correct
University ... but maybe give it a try. If I am incorrect, I apologise
for the misleading information.
Yours,
Lewis M Coward
> -----Original Message-----
> From: Goldberg Felix [SMTP:sgefelix at techst02.technion.ac.il]
> 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.
-----------------------------------------------------------------
WebMath at mail.math.ca - WebMath Mailing List
To unsubscribe:
via Web: http://camel.math.ca/cgi-bin/wcms/webmath.pl
via e-mail: send message a to majordomo at mail.math.ca with
"unsubscribe webmath" in the BODY of message
List Archives: http://camel.math.ca/mail/webmath/
-----------------------------------------------------------------
More information about the Webmath
mailing list