Central High School is competing against Northern High School in a backgammon match. Each school has three players, and the contest rules require that each player play two games against each of the other school's players. The match takes place in six rounds, with three games played simultaneously in each round. In how many different ways can the match be scheduled?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
Each round is one of 6 matchings, in two groups of 3. Either all six are used once, or one group is used twice.
Solution
Call Central's players and Northern's . Write a game as two letters, like .
- What a round looks like. A round has games and players, so every player plays exactly once. A round is a way to match with , one each. There are ways to do that:
| Group 1 | Group 2 |
|---|---|
2. Why two groups. The three matchings in Group 1 share no game, and together they contain all games once. The same is true for Group 2. Also, any matching from Group 1 and any from Group 2 share exactly one game. (For example, the two top rows share .)
3. The rule for a schedule. Each of the games is played exactly twice over the rounds.
4. What that forces. Take any matching from Group 1 and any from Group 2. They share one game. That game is played only in rounds that use or (it is in no other matching). So
This holds for every in Group 1 and every in Group 2. So all Group 1 matchings are used the same number of times, say , and all Group 2 matchings are used times.
5. Three possibilities.
- : all matchings are used once each. Put them in order: ways.
- : the three Group 1 matchings are each used twice, Group 2 not at all. Six rounds, made of three pairs of identical rounds: orders.
- : the same with Group 2: orders.
6. Total. .
The answer is .
Why this works
The key move is to stop thinking about single games and think about whole rounds. Once a round is one of just matchings, the "each game twice" rule becomes a simple rule about how often each matching is used, and it has only three answers. Counting the orders of rounds is then ordinary arranging, dividing by for each pair of identical rounds.
The trap
Treating the 18 games as free to arrange in any groups of 3, without making sure each player plays exactly once in each round.
Concise solution
Call Central's players and Northern's . There are possible games, each played twice, for games in rounds of . Since games use all players, every player plays exactly once per round, so a round is a pairing: a way to match with . There are pairings.
Split them into two families. Family I: , , ; any two of these share no game, and together they cover all games once. Family II: the other three pairings , , , with the same property. Crucially, each game belongs to exactly one Family I pairing and exactly one Family II pairing.
A schedule is a sequence of pairings in which every game appears exactly twice. If a game lies in pairing (Family I) and (Family II), then (times is used) (times is used) . Since every pairs with every through some game, all three Family I pairings are used the same number of times , and all Family II pairings times.
- : each of the pairings once, in any order: schedules.
- : the three Family I pairings twice each: .
- : the three Family II pairings twice each: .
Total: . The answer is .
Review in the AoPS books
- Intermediate Counting & Probability, Chapter 13: Events With States (§13.4)
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.5)
- Intermediate Counting & Probability, Chapter 4: Constructive Counting and 1-1 Correspondences (§4.4, §4.5, §4.6)
- Introduction to Counting & Probability, Chapter 3: Correcting for Overcounting (§3.2, §3.4)
Techniques
Map the objects to something easier to count · Split into exhaustive cases and handle each