FI-MO 1997 Problem 3
knights are sitting at a round table. Every knight is an enemy with two of the adjacent knights but with none of the others. knights are to be chosen to save the princess, with no enemies in the group. How many ways are there for the choice?
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.