Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
Consider a 13x13 checkerboard. It can be partitioned into a collection of smaller square checkerboards in various ways. For example into 169 1x1 checkerboards or into 1 12x12 and 25 1x1 checkerboards. What is the minimum number of smaller square checkerboards that a 13x13 checkerboard can be partitioned into? Show how this can be done. Note we are not asking for (and will not supply) a proof of minimality.
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 minimum number is 11 as illustrated below. This problem is from Sam Loyd via Martin Gardner.
1111111AAAAAA
1111111AAAAAA
1111111AAAAAA
1111111AAAAAA
1111111AAAAAA
1111111AAAAAA
1111111244455
BBBBBB3344455
BBBBBB3344466
BBBBBB7777866
BBBBBB7777999
BBBBBB7777999
BBBBBB7777999
If you have any problems you think we might enjoy, please send them in. All replies should be sent to: ponder@il.ibm.com