RO-TST 2012 Problem 8
Find the maximum possible number of kings on a chess table so that each king attacks exactly one of the other kings (a king attacks only the squares that have a common point with the square he sits on).
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.