### 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

31 March 2014

Posted by on **From New Scientist #1325, 30th September 1982** [link]

Our local football league consists of four teams each of which plays each of the other three once in a season. At the end of one season I looked at their results and started to base a letters-for-digits puzzle on them. As always in my problems of this type, I was going to give part of the final league table with teams in points order (and alphabetically in the event of a tie) and with different letters representing different digits. Based on the 2-points-for-a-win/1-for-a-draw system, part of my puzzle was going to be:

Then I read that the point system was to be changed to 3 points for a win and 1 for a draw, so I temporarily discarded the puzzle. But on reflection I see that for the same season of matches the same table above can still be used for one of my standard football problems, but now in the new point system. Of course the values of the letters might have to be different, but because it is for the same set of matches you should be able to complete (with for the same set of numbers) the following table.

[enigma180]

%d bloggers like this:

This Python program uses the [[

`Football()`

]] class fromenigma.pyto consider the tables for all possible match outcomes under both scoring systems. It runs in 50ms.Solution:The completed table is shown below:There are two different ways the solution can be achieved:

A vs. B match drawn; A vs. C win for C; A vs. D match drawn; B vs. C match drawn; B vs. D win for B; C vs. D win for C.

A vs. B match drawn; A vs. C match drawn; A vs. D win for A; B vs. C win for B; B vs. D match drawn; C vs. D win for C.