### Random Post

### Recent Posts

### Recent Comments

### Archives

### Categories

- article (11)
- enigma (1,367)
- misc (4)
- project euler (2)
- puzzle (90)
- puzzle# (48)
- site news (58)
- tantalizer (94)
- teaser (7)

### Site Stats

- 233,129 hits

Programming Enigma Puzzles

7 December 2016

Posted by on **From New Scientist #1139, 25th January 1979** [link]

Three football teams (A, B & C) are to play each other once. After some (or perhaps all) of the games had been played a table giving some details of the matches played, won, lost and so on was drawn up. But unfortunately Uncle Bungle has been at it again and he decided to replace the digits by letters. Each letter stands for the same digit (from 0 to 9) whenever it appears and different letters stand for different digits.

The table looked like this:

(Two points are given for a win, and one point to each side in a drawn match).

Find the score in each match.

[puzzle87]

%d bloggers like this:

I used the [[

`Football()`

]] helper class from theenigma.pylibrary to solve this one.This Python program runs in 60ms.

Solution:The scores in the matches are: A v B = 6-5; A v C = 3-1; B v C = 3-3.The values for the letters are: d=1, h=6, k=2, m=8, p=4, r=0, x=9.