RU-SPB 2020 Problem 112
- Grade 11
A short-sighted rook is a rook that beats all squares in the same column and in the same row for which he can not go more than - steps. What is the maximal amount of short-sighted rooks that don't beat each other that can be put on a chessboard.
Dataset text AoPS wiki problems. Quoted with source.
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.