BG-MO 1975 Problem 5
Let the subbishop (a bishop is the figure moving only by a diagonal) be a figure moving only by diagonal but only in the next cells (squares) of the chessboard. Find the maximal count of subbishops over a chessboard , no two of which are not attacking.
V. Chukanov
Dataset text AI-MO AoPS. 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.