Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
This month's puzzle spawned from a true story: Danny Arnon's solution for David Meiri's volleyball practice. Thank you both for the story.
Consider 9 teams playing volleyball on three courts simultaneously.
In each round, there are three teams on each court: two are playing against each other, while the third team is refereeing.
If the teams are numbered 1-9, you can represent the first round in the following manner:
1 2 (3) 4 5 (6) 7 8 (9)
On the first court, Team 1 plays against Team 2 while Team 3 referees; on the second court, Team 6 referees the play between Team 4 and Team 5, etc.
Here are the requirements for scheduling play:
(a) We need a 12-round schedule in which each team plays all eight other teams exactly once, and referees four times.
(b) After a team serves as referee, they should have at least two consecutive rounds of play before they have to referee again.
Can you make an ideal schedule that satisfies all our requirements?
If not, find a schedule that fulfils condition (a) and minimizes the number of times condition (b) is violated.
Please send your solutions as 12 lines of 9 digits each.
We will post the names of those who submit a correct, original solution! If you don't want your name posted then please include such a statement in your submission!
We invite visitors to our website to submit an elegant solution. Send your submission to the ponder@il.ibm.com.
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com
First, we prove that no solution can exist without violating at least once either condition (a) or condition (b).
If such a tournament takes place, it's easy to see that the same three teams will have to referee together, splitting the nine teams into three triplets.
Let's call them groups A, B and C.
Any game between a team from group B and a team from group C must take place when a group A team is refereeing.
In each round when group A teams are refereeing, the number of BB games (i.e., both teams from the B group) is the same as the number of CC games.
Therefore the number of BC games is odd (3-BB-CC). There are nine BC games and four A-refereeing rounds, but 9 cannot be expressed as a sum of four odd numbers, so that proves that we cannot fully fulfill conditions (a) and (b).
Allowing for a single violation is enough. For example, the solution below fulfills condition (a) and violates (b) only once when team 7 referees in the 11th and 9th rounds.
4 9 (1) 5 7 (2) 6 8 (3)
1 7 (4) 2 8 (5) 3 9 (6)
1 3 (7) 2 4 (8) 5 6 (9)
6 9 (2) 7 8 (3) 4 5 (1)
2 9 (5) 3 7 (6) 1 8 (4)
2 5 (8) 3 6 (9) 1 4 (7)
7 9 (3) 4 6 (1) 5 8 (2)
3 8 (6) 1 9 (4) 2 7 (5)
3 4 (9) 1 5 (7) 2 6 (8)
4 8 (1) 5 9 (2) 6 7 (3)
1 6 (4) 2 3 (5) 8 9 (7)
1 2 (8) 3 5 (9) 4 7 (6)