2026.10October 2026

Mixed Signals

In Gomoku, time is often of the essence!

A 15x15 Gomoku board with pieces placed. There is one more yellow than red piece. Each piece has two markings on it.

# submissions are closed. the solution is below.

solution[show]

A quick analysis of the current position shows that there is exactly one winning move for red, whose current turn it is. But what do the marks mean?

Noticing that the colors of the pieces are red and yellow instead of the traditional white and black, we can guess at the encoding system used to hide a message in the marks. A little bit of resarch will bring us to flag semaphore, using 2 arms at 45 degree angles and matching the coloring.

Decoding the message using flag semaphore gives us "THE MOVE THAT GUARANTEES RED VICTORY SHOULD BE PLAYED THIS MANY ROWS FROM THE TOP". The winning move is to play at H8, and so our answer is "8".

After a lack of solves for Lorun, Pelu, Sovel, this puzzle replaced it. Congratulations to our solvers!

solved by3

  1. 01ado fan #2
  2. 02Ado Fan #accel
  3. 03dannyy39 + frostydasnoman

2026.09September 2026

Minedknight

A knight must cross this minefield from S, in the top-left corner, to F, in the bottom-right.
There are 17 mines shown in the configuration below. The knight does not know the configuration of these mines, only the total number and any numbers it has revealed.

When moving, the knight follows these rules:

  1. Each jump moves two squares in one direction and one square on the orthogonal axis. It cannot leave the board or revisit a square it has landed on.
  2. Landing in a cell reveals the number of mines in the eight neighboring squares, including diagonals. Revealing a zero also reveals all connected zeros and their bordering numbered squares. The shaded numbers show the initial reveal from S.
  3. The knight may jump only to a square that is certain is safe. That is to say, if it is at all possible that there will be a mine in a certain tile, the knight will not jump to it.

Number the visited squares from 1, starting at S. If cic_i is the number of adjacent mines at the square visited on step ii, find

∑i=1Li ⋅ci.\sum_{i=1}^{L} i\,\cdot c_i.

Count both endpoints. Your submission should be the integer you receive.

bonus points if you know what the title is a reference to :)

solution[show]

A 9x9 minefield with numbered cells and arrows depicting the knight's route from S to F.

The unique successful route visits 39 squares. Its adjacent-mine counts, in order, are:

0, 1, 2, 0, 1, 1, 2, 1, 1, 1, 2, 2, 0, 1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 0, 1, 3, 4, 1, 3, 3, 4, 0

Multiplying these by the step numbers 1 through 39 and adding gives ∑i⋅ci=1429\sum i \cdot c_i = 1429.

Note that knowledge of the total mine count is essential at step 38. If that square contained a mine, the revealed clues would require at least 18 mines, but, since we know that the 17 mines exist in other positions, it must be safe.

Congratulations to anyone who didn't explode!

solved by0

no solves yet! be first 🩸?