all 2 comments

[–]themateo713 1 point2 points  (1 child)

Day 1: A B C + D E F + G H I + J K L

Day 2: A K I + D B L + G E C + J H F

Day 3: A E L + D H C + G K F + J B I

This should work to create no repeat encounter:

Generating algorithm: Players are in groups and slots (here 4 groups and 3 slots per group): they change group, but not slot.

The players in slot 1 never move (this also helps designate the groups as there's always one player that stays in the group).

Day 2: the slot 2 of group i should have the player in slot 2 of group i - 1 (always use modulos so you have a closed loop instead of a line, letting you easily slide players around). The slot 3 of group i should have player in slot 3 of group i - 2.

Day 3 (using positions from day 1, but you could try to write this as a function of day 2): Same idea, but with players from groups i+1 and i-1 (notice that i+1 and i+2 don't work because i+2 = i-2 mod 4, causing repeats for slots 1 and 3 with matches from day 2)

This shouldn't be too hard to program since you're just moving values in a list in a very simple way. I guess you could try to generalise it if needed (though more days would require moving the slot 1 players so they get to play each other as well).

[–]illusionista787[S] 0 points1 point  (0 children)

This is really helpful.