Knights at a round table
Source: Finnish Mathematics Competition 1997, Final Round, Problem 3
November 14, 2011
combinatorics unsolvedcombinatorics
Problem Statement
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?