I'm currently trying to find an algorithm to place players during a Mahjong tournament.
Here are the requirements :
- Number of players in the tournament : $n$ with $n \equiv 0 \pmod 4$
- Number of tables in the tournament : $n/4$ (4 players per table)
- A tournament has $x$ rounds (determinated by the algorithm according to $n$)
- A player must never meet another player twice
The goal is to find how many rounds I can set for $n$ players.
I found some documentation about Swiss-system tournament, and I would like to know if an equivalent exists for quartet instead of pairs.
Thanks for your help.