Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
This month's challenge is based on a puzzle by Barry Cipra, presented at the tenth Gathering for Gardner conference at Atlanta.
There are six sets of jobs. Each set is performed on a different server and each set contains jobs that take 1,2,3,...,10 minutes to run.
Obviously, all six sets would end up in 55 minutes.
Schedule all the sets such that if all six servers start together, on minute 0, a job would end on every minute from 1 to 54, and all six servers would end on minute 55 together.
Please supply the solution as six lines of ten numbers.
A solution for a smaller problem of four sets of six jobs ending every minute from 1 to 20 is:
2 1 5 4 6 3
1 3 6 4 5 2
5 2 4 6 3 1
6 3 4 2 1 5
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
There are many solutions, some of which have quite a few interesting symmetries, like Joël Bleuse's solution (note the place of the 7-s):
1 8 3 2 5 9 7 10 4 6
2 5 10 9 7 1 6 4 8 3
5 3 8 2 6 1 7 10 9 4
4 9 10 7 1 6 2 8 3 5
3 8 4 6 1 7 9 10 5 2
6 4 10 7 9 5 2 3 8 1
Matej Kollár even wrote a nice tool http://www.fi.muni.cz/~xkollar2/symmetry-helper-1/ and used it to find a nice symmetric solution.
We think that for any even n>3, there is a solution for n permutations of 2n-2 elements, but we don't have a proof for it.