Ponder This Challenge - February 2026 - Blot-avoiding backgammon strategy
- Ponder This
This puzzle was suggested by Gyozo Nagy - thanks!
We play the following game on an board: We control a frog that starts somewhere on the board. The cells of the board can be either white ("empty"), blue ("visited"), or red ("forbidden"). At the beginning of the game, the whole board is white except for a blue cell where the frog starts. On each step of the game, the frog moves to one of the eight adjacent cells. We denote the possible moves with the letters A, B,...,H clockwise around the current cell, such that A is a move to the cell directly to the right, B is a move to the cell below and to the right, and so on around the current location of the frog. To move to a cell, the following conditions must apply:
After the move is performed, the cell now containing the frog turns from white to blue.
In addition, the next cell in the same direction (the one that could not be blue), if it exists, becomes red (or remains red if it was already that color).
The goal of the game is to reach a state where only non-white cells remain on the board (the number of red or blue cells does not matter).
For example, in a 4x4 board starting from (0,0) (the top-left corner), performing the sequence of moves "ABHCDBEFDGH" results in a fully colored board with 4 red cells.
Your goal: Solve the game for a 20x20 board starting from (0,0). Give your solution as a string of letters as shown above.
A bonus "*" will be given for solving the game for a 10x10 board starting from (4,4).
June 2025 Solution:
Solutions, in string form:
Main challange:
CHCHCHCHCHCHCHCHCHCHCHCHCHCHCHCHCHCHBGDBEBEBEBEBEBEBEBEBEBEBEBEBEBEBEBEBDAFDGDGDGDGDGDGDGDGDG
DGDGDGDGDGDGDGDFCHFAFAFAFAFAFAFAFAFAFAFAFAFAFHEBHCHCHCHCHCHCHCHCHCHCHCHCHCHBGDBEBEBEBEBEBEBEB
EBEBEBDAFDGDGDGDGDGDGDGDGDGDGDFCHFAFAFAFAFAFAFAFHEBHCHCHCHCHCHCHCHBGDBEBEBEBEBDAFDGDGDGDGDFCH
FAFGBGBGBGBG
Bonus:
ADADADADCHCHCHCAGAGFEHAFEHAFHGDGEDCFGDFCBDADCDCDBEFGHGEGHFGBGHC
The main challenge can be tricky to solve via search algorithms due to the sheer board size; however, if one tries to play the game manually, it is relatively easy to notice and exploit some simple patterns that can effectively handle any board. The 10x10 case is more tricky due to the starting point in the middle, but in this case the board size allows relatively easy computer search.
For those who wish to play the game themselves, an html implementation can be found [here]
The solutions, in image form: