Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
This month's challenge is from Thomas Dueholm Hansen and Uri Zwick (thanks).
Find a matrix of bits T which has 6 columns and at least 21 rows such that the following holds:
For every row 1<=i_1<21 there exists a column j such that T(i_1,j) != T(i_1+1,j) and T(i_1+1,j) = T(21,j)
For every pair of rows 1<=i_1< i_2<21 there exists a column j such that T(i_1,j) != T(i_1+1,j) and T(i_1+1,j) = T(i_2,j) = T(i_2+1,j).
Here is an example of a solution for the same problem with an 8 x 4 matrix:
0011
1101
1010
1100
0110
0100
0000
0001
Bonus question: Find this type of matrix with 7 columns and at least 33 rows.
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
One can solve this problem by either encoding it as a CNF formula and using any SAT solver, or running backtracking from the bottom of the table T.
Here are solutions for 21x6
000000
111111
100000
111110
010000
111100
001001
001110
010100
001101
100100
101101
110101
000111
110111
100011
110011
111011
111010
011010
011000
and for the bonus 33x7
0000000
1111111
1000000
1110111
0100000
1101111
0000010
1110011
1101000
0111011
1001001
0110001
1000101
0010001
1011101
0011000
1011110
1110000
1010110
1110100
0011100
0110101
0001101
0111101
0101100
0100111
0101101
0101111
0101010
1101011
1101010
1111010
1111110
The best solutions are
2x1
3x2
5x3
8x4
13x5
21x6
Bonus question: Can you find a 34x7 solution and keep the Fibonacci sequence?