Interesting problem that I havent solved yet

For some real life games you need to organize groups. Ideally, we need to make sure that every player of every team is played at the table with every player from the other teams.
So you given N teams with M players in each. You need to generate groups with a minimum amount of repeated meetings of players at the table.
The best thing I got rn is to imagine them as circles

(  ) outer circle move clockwise
 () inner cicle counter-clockwise
Comments (0)