Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
Given an NxM binary matrix, we can compute the N sums of the rows and the M sums of the columns . These sums can sometimes uniquely define the matrix. For example, the sums [1,2,0][2,1] can be generated only from the matrix
1 0
1 1
0 0
But sometimes there are several options. For example [1,1,2][2,2] can be generated from two matrices:
0 1 1 0
1 0 0 1
1 1 1 1
The challenge this month is to find sums that are generated from exactly 29 different binary matrices.
To rule out trivial solution, we further require that each matrix have no more than 50 bits.
Please provide your answer as two lines, the first line with N integers and the second with M integers. N*M should be no more than 50.
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
The trivial solution for any number N is [1,1,1,...,1][1,N-1], which gives a 56-bit matrix in our case (N=29). To disallow this solution, we required that the matrix have no more than 50 bits.
The second systematic way is [M-1,1,1,1,...,1][N-1,1,1,1,...,1], which generates 1+(N-1)*(M-1) matrices. This gives solutions like [7,1,1,1,1][4,1,1,1,1,1,1,1].
Gyorgy Gyomai sent us another way to generate a set of numbers: [M-1,2,1][2,2,1,1,1,...,1], which gives 3*k-4 different generating matrices, giving the solution [10,2,1],[2,2,1,1,1,1,1,1,1,1,1].
The smallest solution (24 bits) is [1,2,3,5],[1,1,1,2,3,3].