### Random Post

### Recent Posts

### Recent Comments

### Archives

### Categories

- article (11)
- enigma (1,115)
- misc (2)
- project euler (2)
- puzzle (29)
- site news (43)
- tantalizer (29)
- teaser (3)

### Site Stats

- 166,357 hits

Programming Enigma Puzzles

30 October 2015

Posted by on **From New Scientist #1465, 18th July 1985** [link]

In the fruiterers football league, each of the four teams plays each of the others once. Three points are awarded for a win and one for a draw. The table below shows part of the League Table at the end of last season. As usual, different letters stand consistently for different digits.

The four teams, Appleton Rovers, Banana Splits, Cox’s Pippins and Damsons United are in order of merit, goal differences having to be used just once to divide them.

List all the victories last season (e.g. X beat Y, P beat Q, etc).

[enigma317]

Advertisements

%d bloggers like this:

Another football puzzle. But this one is set by Susan Denham, not Eric Emmet.

It is relatively easy to solve using the

Football()helper class from theenigma.pylibrary. This Python program runs in 72ms.Solution:Appleton beat Damson’s. Banana beat Damsons.The remaining matches (A v B, A v C, B v C, C v D) were draws.