**From New Scientist #1339, 6th January 1983** [link]

This is a letters-for-digits tennis teaser. As always different letters stand consistently for different digits. The final score in our tennis club’s Mens Singles final was *A*–*B*, *C*–*A*, *D*–*E*, *F*–*G*, *F*–*E*. Tie breakers occur at 8-8 and are recorded as 9-8 (or 8-9) and are not allowed in the final set. This particular match was very close: at two stages in different sets the eventual winner had match point against him.

Give the score (in numerical form) of the final three sets.

**Enigma 101** is called “Game, set & match”.

[enigma193]

### Like this:

Like Loading...

The Python program examines all possible letter to digit assignments and checks to see if they make a valid match. It runs in 339ms.

Solution:The score in the final three sets was 5-7, 9-8, 9-7.The program finds 20 ways to achieve the solution, these correspond to the scores in the first two sets being 6-

xandy-6, where (x,y) correspond to all possible 2-permutations from (0, 1, 2, 3, 4), and P(5, 2) = 20.