Round Robin Tournament Scheduling

Schedules - You must register to Post and Download => Requests => Topic started by: Trio on May 17, 2010, 08:15:55 AM

Title: Golf schedule variation
Post by: Trio on May 17, 2010, 08:15:55 AM

Hello to everybody!
I'm facing a combinatorial problem that looks like the golf schedule. The original problem said that the goal is to select, for example, the threesomes so that each person only golfs with the same person once. Instead I would find the threesomes so that each person only golfs with the same other members of the team once. In practice for 6 members I would like to arrange 20 terns:
123, 124, 125, 126, 134, 135, 136, 145, 146, 156, 234, 235, 236, 245, 246, 256, 345, 346, 356, 456.
in a 10 [20/(6/3)] days calendar.
Do you know if there is an algorithm that solves this problem for N members?
Thanks in advance!

Title: Re: Golf schedule variation
Post by: Ian Wakeling on May 18, 2010, 08:14:14 AM

Just peel off the first and last from your list.

123 & 456

then keep repeating:

124 & 356,  125 & 346 etc....

Title: Re: Golf schedule variation
Post by: Trio on May 18, 2010, 08:34:26 AM

Thanks Ian for your prompt answer.
Your method works fine for N=6 members but is not longer valid for any other multiple of 3...