Enigma 1220: Matchless days
From New Scientist #2376, 4th January 2003 [link]
Albion, Borough, City, Rangers and United are due to play another tournament in which each team will play each of the other teams once. One match will be played on each of 10 consecutive days.
Though the schedule of matches ensures that no team will ever play on two consecutive days United has complained that it has fewer matchless days between its first match and it last match than any of the other teams. Albion has the greatest number of matchless days between its first match and its last match, and Borough the second greatest number of matchless days between its first match and its last match. Rangers will play United one day before Albion play City.
On which of the days 1 to 10 will Borough play? And who will be Borough’s opponents on each of those days?
This puzzle completes the archive for 2003. There is a now full archive of the final 11 years of Enigma puzzles, from the start of 2003 to the end of 2013, as well as an archive from the start of Enigma in February 1979 to January 1985. In total there are currently 858 Enigma puzzles on the site.