Hi Bob,

One of my consultants, Victoria West, has a student who has written a computer program to solve this type of problem. It was run on your question but it took some time to arrive at a schedule. There are 98 million possible schedules to examine and about 3.5 million are checked per hour. It was completed a few days ago but I have been away and haven't been able to post it.

The optimal schedule is displayed below. The way to read the schedule is that the players are the positions, and the number in position p is the group that player p is in on that day. The groups can be renumbered so that player 1 does not always tee off in the first group.

Day 0 : (0, 0, 0, 0, 1, 1, 1, 1, 2, 2)
Day 1 : (0, 0, 1, 1, 0, 0, 1, 2, 1, 2)
Day 2 : (0, 1, 0, 2, 1, 2, 0, 1, 1, 0)
Day 3 : (0, 1, 2, 0, 2, 1, 1, 0, 0, 1)

Harley and Victoria