Sunday Times Teaser 3347 – Croquet League
by John Owen
Published Sunday November 15 2026 (link)
In our croquet league, everyone plays against everyone else exactly once during the season. At the end of the season, the top four players, ranked by number of wins (draws are not possible), progress to the playoff stage. If players are tied on number of wins, then individual game scores are used to determine the ranking. The minimum number of wins needed to guarantee progression (irrespective of individual game scores) is four times the maximum number of wins with which it is impossible to progress (again irrespective of game scores).
How many players are in the league?
2 Comments
Leave one →
Based on Jim Randell’s solution.
Back from walking the Camino Frances.
This version prints the first solution to the problem.
My adaptation to decompose() seems to generate the correct score sequences that are possible in an n-team round-robin tournament (not following the Landau’s theorem).