Hi all,
I am glad this site is here for such complex problems. Or at least what I perceive as a complex problem.
I am in the final planning stages of our golf trip when my buddy came up with a plan to try and switch up the pairings. So here is my problem. I am not sure if it is even possible to solve and I couldn't really find a good answer here before or on the web to get this started.
10 players
2 teams of 5
6 "rounds" of golf 9 holes each.
Team 1 - ABCDE
Team 2 - 12345
As an example we are hoping for all 3 days to look something like this
Front 9 (Match 1)
Group 1 - AB12
Group 2 - C3
Group 3 - DE45
Back 9 (Match 2)
Group 1 - A1
Group 2 - BC23
Group 3 - DE45
Basically two players from the first foursome will hang back after the 1st 9 holes and pair up with the twosome in group 2 while group 1 remaining players will continue on against each other.
So in ideal situation we are trying to minimize teammates playing together over the 3 days (6 - 9 hole rounds) and also minimizing playing an opponent. One more constraint is that we want to minimize the number of times that a single player plays in the twosome. We were hoping for 1 guy from each time would only be able to do this.
In order of importance:
Minimizing the number of times that a single player is in a twosome
Making sure that you play with your teammates at least once
Playing opponents at least once.
I guess all problems are solvable but are we just banging our heads against the wall to make a viable solution?
