ILL 1971 Problem 10
In how many different ways can three knights be placed on a chessboard so that the number of squares attacked would be maximal?
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.