We have 24 people, and 4 tables. Over 4 sessions, each person will visit each table once. What system can I use to make sure each person gets to each table once, while making sure they meet as many other people as possible (so dont go from table to table with the same people).
Is there something that can help with this?
Apologises if this doesnt belong in Maths, not sure what kind of problem it is?
Most average:
Turn 1:
Table x(1-4) seats people (xa-xf). Everybody meets 5 people.
Example: Table 1 seats 1a,1b,1c,1d,1e,1f
Turn 2:
xa and xb go to table x+1; xc and xd go to table x+2, xe and xf go to table x-1
Example: Table 2 seats 1a,1b,4c,4d,3e,3f. Everybody meets 4 new people.
Turn 3: xa,xc,xe got to the next table they haven't been to and xb,xd,xf go to the previous table they havent been to.
So Table 3 seats 1a,4b,4c,2d,1e,2e. Everybody meets 3 new people.
Turn 4: everybody goes to the table they haven't visited.
So Table 4 seats 1a,2b,3c,1d,2e,3f. Everybody meets 3 new people. Everybody met 15 people.
I don't know if that can be beat.