Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!uhog.mit.edu!europa.eng.gtefsd.com!howland.reston.ans.net!gatech!asuvax!ennews!enuxsa.eas.asu.edu!chisti
From: chisti@enuxsa.eas.asu.edu (abrar chisti)
Subject: Substitution Puzzle (AI)
Message-ID: <D03L0B.8Gx@ennews.eas.asu.edu>
Nntp-Posting-Host: enuxsa.eas.asu.edu
Sender: news@ennews.eas.asu.edu (USENET News System)
Organization: Arizona State University, Tempe, AZ
Date: Wed, 30 Nov 1994 20:31:23 GMT
Lines: 29

Hi:

Can somebody please help me on the following problem:

Any idea as to how to solve the following substitution puzzle would be
very much appreciated. I need to write it in LISP.


                    S  E  N  D
                 +  M  O  R  E
                 -------------
                 M  O  N  E  Y

Every character can take a value 0-9. What I can think of is iterating
through all the possible combinations until the equation holds true.
But I don't know how to narrow down the search space - and thus write
a more intelligent solution. Of course, the above problem has many 
solutions, and I do need to find them all. But without going through
all possible combinations. Also, the solution should be general enough
to solve other such problems, without too many changes to the code.

Any help will be greatly appreciated.
Please reply by e-mail.

A t D h V a A n N k C s E

Cindy 


