You are not logged in.
Pages: 1
Let me explain better.
We want a gift rotation that can be easily changed year to year. Currently it works like John Franklin's suggestion. However we want something more complex.
We would like to have groups of 2 or 3 families visit each other and give gifts. Since there are 10 siblings, and 1 parent group, we will actually have 3 families, 3 families, 3 families, and 2 families. So year 1 would look like this: Families are numbered 1-11 and each line represents a group who would visit and exchange gifts
1,2,3
4,5,6
7,8,9
10,11
So then in year 2 we don't want anyone visiting the same people- it might look like this
1,4,7
10,2,5
8,11,3
6,9
So, then it gets complicated to keep people visiting different people each year. I want to optimize and make this work. My husband suggests doing it like a partial n chart- Any thoughts how to make it so everyone visits everyone else in the fewest number of years possible?
Our family gives gifts to only 2 members at a time. We want to have a rotation that allows 3 families to give to each other at a time so they can visit and exchange gifts. There are 11 members- how can we do this? I started simply with 123 give to each other, 456, then 789 and then just 2 families 10 and 11. I want the combinations to work so that each family gives to all the other families with as few repeats as possible so the next combo might 1 4 10, 2 5 11, 3 6 9, 5 and 8. Please help with a formula that would work.
Pages: 1