- 03 Aug '08 23:50

Solution sent. I verified only one solution.*Originally posted by David113***....R...A...F...A...E...L**

+.......N...A...D..A...L

----------------------------

....T...E...N...N...I...S

Each letter represents a different digit. Reconstruct the sum.

(the dots are there just for alignment)

The relationships of D & F, A & N were very key to the testing process, although I did use a bit of trial and error. - 05 Aug '08 21:46 / 1 edit

My girlfriend found that one as well, heheh.*Originally posted by forkedknight***I found a solution if you allow 'T' to be 0 (with a leading 1).**

..975712

+..37672

----------

1013384

Still working on T != 0

*edit* I guess that would work if you play tennis online

E-Tennis, eh? That would be interesting.. - 06 Aug '08 20:55 / 1 editHow about peoples' methods for solving this one and/or other similar puzzles in general.

I created an Excel spreadsheet and played around with relationship formulas and error conditions. I can email it to you if you'd like to see it.

We coded a general solver for this type of problem in SCHEME/LISP in my artificial intelligence class at university last semeseter. I didn't have that code handy for this problem though. - 06 Aug '08 21:49

Well, the method which worked for me is as follows.*Originally posted by forkedknight***How about peoples' methods for solving this one and/or other similar puzzles in general.**

I created an Excel spreadsheet and played around with relationship formulas and error conditions. I can email it to you if you'd like to see it.

We coded a general solver for this type of problem in SCHEME/LISP in my artificial intelligence class at university last semeseter. I didn't have that code handy for this problem though.

In initially working with the problem, I noticed two additions..

A + D = N

A + F = N

Based on this, one of the two have a carry added in, the other does not.

In addition to this, A cannot be 0 or 9, or else A = N.

N can't be 0 as it starts a number, and for some reason, I had eliminated N = 9 as well. The reason may come to me.

At any rate, since the two sums occur beside each other, I can determine what D and F are from A and N.

I simply tried each combination of A and N, eliminating first those where I had matching numbers, as well as those where A + N + 1 resulted in no carry (since R + 0 = T...)

Each test was straightforward, with solving for E leading to quick judgment of each case. - 07 Aug '08 01:18i also did A and N combinations. later i tried a php script that solves it, but without success. but now that this is solved i thought of creating my own puzzle. and since i saw all 41 episodes of sledge hammer in the last week, i had a good idea right away... (trust me, i know what im doing!)

........S...L...E...D...G...E

-.......H...A...M...M...E...R

-------------------------------

............G...R...E...A...T

now the problem with this is, that it probably doesnt have a solution.

i also tried php and for some reason it can calcuate - better than + so it spitted out some solutions (i didnt limit it with stuff like S!=H because that would just cause a timeout without results).

so the only solutions i get is with S=H and A=D. maybe someone can think of a better result-word. the word "sledge hammer" uses 9 letters already, so you have just 1 extra letter you can use.

so this is a 2-in-1 puzzle:

a) solve this or show there is no solution

b) find a "esult-word that brings a solution