Ponder This Challenge - March 2026 - Path game on a hole-riddled chessboard
- Ponder This
This riddle was proposed by Lorenzo Gianferrari Pini and Radu-Alexandru Todor - thanks!
Given a square binary matrix of order , such there is exactly one "1" value in each row and column of , we can find the lowest such that , the identity matrix.
Denote by the maximum such when going over all the matrices in satisfying the above condition.
For example, and .
Your goal: Find .
A bonus "*" will be given for finding .
The numerical solutions are
The binary matrix formulation is a thin disguise for Landau's function, which gives the largest order to an element of the symmetic group (the group of permutations on elements).
Since this is a known function, the main challange of the riddle was to find heuristic for efficient computations.
A common approach is to consider the computation of as a solution to a specific Knapsack problem:
Since every element of is a product of distinct cycles on elements total, and its order is the LCM of the lengths of the cycles, the challange is to find numbers such that while maximizing , which can be done via dynamic programming.