|
|||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||
Jim, There isn't a perfect schedule. In fact there really isn't a very good one. I wrote a program to check all of the possibilities. Here is the best solution it found:
The threesomes are numbered 0 and 1. The positions in the list are the players 1, 2, 3, 4, 5, 6. For example, on Day 3 the threesomes are 1,2,5 and 3,4,6. Have some fun.
Hi Terry, Suppose the 6 golfers have names A, B, C, D, E and F. Each day they are divided into two threesomes, the "0" threesome and the "1" threesome. I labeled the columns of Victiria's table by the golfers names to get the following.
The 0's and 1's in the body of the table identify the threesomes. Notice that A is always in the "0" threesome and player F is always in the "1" threesome. For any other player read down his or her column. For example Player D is in the "1" threesome on days 1 and 3 and in the "1" threesome on days 2 and 4. I hope this helps, | |||||||||||||||||||||||||||||||||||
|
|||||||||||||||||||||||||||||||||||
Math Central is supported by the University of Regina and The Pacific Institute for the Mathematical Sciences. |