RU-ALLRUSSIAN 1985 Problem 3
An chess- board is colored in the usual way. What is the largest number of pieces can be placed on the black squares (at most one per square), so that each piece can be taken by at least one other? A piece A can take another piece B if they are (diagonally) adjacent and the square adjacent to B and opposite to A is empty.
Dataset text NuminaMath olympiads. 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.