### 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,124 hits

Programming Enigma Puzzles

29 December 2011

Posted by on **From New Scientist #2778, 18th September 2010** [link]

There are five teams in our local football league and each plays each other once in the season, earning 3 points for a win and 1 for a draw. Here is the league table from the end of last season, but only part of it is shown. And digits have consistently been replaced by letters, with different letters used for different digits. The teams are in decreasing order of points, with no two tied. List the results in those games which were not draws, in the form “X beat Y”.

**Enigma 1695** is also called “Odd one out”.

[enigma1613]

%d bloggers like this:

The following Python program runs in 450ms.

Solution:The non-draw games are: Ailing beat Beeling, Ailing beat Ceiling, Ailing beat Deeling, Ailing beat Ealing, Beeling beat Ceiling and Ceiling beat Ealing.