When I first saw the problem I had no idea how we could come up with a equation to generalize what seat would win every time. But my idea for a strategy was to start with a different number of people at the table each time and make an x,y table for the amount of knights at the table and the winning seat. Then to look at the table to try to see patterns and to attempt to generalize the pattern into a function then.
