HMMT 2024 C2
- Combinatorics
- Answer
A lame king is a chess piece that can move from a cell to any cell that shares at least one vertex with it, except for the cells in the same column as the current cell. A lame king is placed in the top-left cell of a grid. Compute the maximum number of cells it can visit without visiting the same cell twice (including its starting cell).
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
43
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.