Problem: Nine delegates, three each from three different countries, should be seated at a round table that seats nine people. How many different ways are there to seat them in such a way that no two delegates from the same country seat near each other? All the delegates are different, and arrangements that differ only by rotation are considered the same.
Solution: I've found a dull solution for the problem. You just fix some guy from one of the countries in the "first" place and build all possible correct arrangements. First you consider all the different ways two other guys from the same country can be placed. And after that one can just see that leftover places are split into one of the three possible groups $1 + 2 + 3$, $1 + 1 + 4$, $2+2+2$. For each of the splits you count number of ways to seat other delegates and thus find the answer. But this method involves drawing a lot of tables and seems like prettified bruteforce solution.
Question: is there another more elegant way of solving the problem? Statement reminds of Lovász local lemma, but this lemma gives only some bound for probability. May be there are some another theorem on coloring or something like this?
Thanks in advance for any ideas.