### Random Post

### Recent Posts

### Recent Comments

### Archives

### Categories

- article (11)
- enigma (1,176)
- misc (2)
- project euler (2)
- puzzle (44)
- site news (46)
- tantalizer (48)
- teaser (3)

### Site Stats

- 183,172 hits

Advertisements

Programming Enigma Puzzles

17 November 2014

Posted by on **From New Scientist #1384, 17th November 1983** [link]

In our local football league the six teams, Algols, Basics, Computers, Digitals, Electronics and Fortrans, each played each other once this season and the end-of-season league table has just been published. The teams finished in alphabetical order with no two teams scoring the same total number of points. We work on the system of 3 points for a win and 1 point for a draw. Just knowing each of the teams’ total points, and the fact that during the season there had been at least twice as many draws as wins, enabled me to work out the result of each match.

Someone beat Basics. Which team (or teams)? And which team(s) beat Fortrans?

[enigma238]

Advertisements

%d bloggers like this:

This Python program uses the

Football()class from theenigma.pylibrary. It runs in 5.5s, so it’s not particularly elegant or particularly fast.Solution:Basics lost to Algols. Fortrans lost to Algols, Basics and Computers.