Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
Ponder This Challenge:
Consider a random walk on the 2-d integer lattice starting at (0,0). From a lattice point (i,j) the walk moves to one of the four points (i-1, j), (i+1, j), (i, j-1) or (i, j+1) with equal probability. The walk continues until four different points (including (0,0)) have been visited. These four points will form one of the five tetrominoes (considering mirror images to be the same). For each tetromino find the probability that it will be the one formed in this way.
Please make sure you clearly identify the tetrominoes when submitting a solution. You may wish to use the wikipedia letter designations, I,L,O,S and T. A few solutions did not receive credit
because I could not tell which tetrominoes were which. Also I am requiring exact values for the probabilities.
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
XXX = 8/21 XX = 4/21 XX = 4/21 XXX = 3/21 XXXX = 2/21
X XX XX X
They can be found by working out the transition probabilities from smaller forms. The calculations are simplified by taking symmetry into account. For example at each step the unique domino has a 1/2 probability of becoming a bent tromino, a 1/4 probability of becoming a straight tromino and a 1/4 probability of remaining a domino. So the random walk has a 2/3 probability of forming the bent tromino and a 1/3 probability of forming the straight tromino. Similarly one can compute the probability of transitioning from each tromino to each tetromino (keeping track of whether the walker is in the middle or at the end of the tromino). Then sum over the ways of forming each tetromino to find the values above. I omit the details.
Thanks to Jack Kennedy for the following illustration of the solution: