I have 4 groups: g1, g2, g3, g4
Each group has 8 sections:
g1s1, g1s2, g1s3, g1s4, g1s5, g1s6, g1s7, g1s8
...
g4s1, g4s2, g4s3, g4s4, g4s5, g4s6, g4s7, g4s8
I need to find all unique combinations of groups and sections, where there are 2 sections from each group and no overlap.
e.g., [[g1s1, g1s2, g2s3, g2s4, g3s5, g3s6, g4s7, g4s8], ..., [g1s5, g1s7, g2s2, g2s8, g3s1, g3s4, g4s3, g4s6]]
This is fairly straightforward with a single section, but with 2 unique sections, I'm lost.
?(?,?)=?(32,4)=35960
Brute forcing the problem with some code has lead me to believe there are 1,440 combinations.
Can someone help me with the math, or offer some vocabulary that would help me google this.
Thanks.
Each group has 8 sections:
g1s1, g1s2, g1s3, g1s4, g1s5, g1s6, g1s7, g1s8
...
g4s1, g4s2, g4s3, g4s4, g4s5, g4s6, g4s7, g4s8
I need to find all unique combinations of groups and sections, where there are 2 sections from each group and no overlap.
e.g., [[g1s1, g1s2, g2s3, g2s4, g3s5, g3s6, g4s7, g4s8], ..., [g1s5, g1s7, g2s2, g2s8, g3s1, g3s4, g4s3, g4s6]]
This is fairly straightforward with a single section, but with 2 unique sections, I'm lost.
?(?,?)=?(32,4)=35960
Brute forcing the problem with some code has lead me to believe there are 1,440 combinations.
Can someone help me with the math, or offer some vocabulary that would help me google this.
Thanks.