MathDB
Maximal walk in a special array

Source: Romania JBMO TST 2024 Day 1 P5

July 31, 2024
combinatoricsboard

Problem Statement

An nn-type triangle where n2n\geqslant 2 is formed by the cells of a (2n+1)×(2n+1)(2n+1)\times(2n+1) board, situated under both main diagonals. For instance, a 33-type triangle looks like this:https://i.ibb.co/k4fmwWY/Screenshot-2024-07-31-153932.pngDetermine the maximal length of a sequence with pairwise distinct cells in an nn-type triangle, such that, beggining with the second one, any cell of the sequence has a common side with the previous one.
Cristi Săvescu