|
|||||||||||||||
|
|||||||||||||||
| |||||||||||||||
Scott, Here is a 10-day schedule taken from http://www.mathpuzzle.com/MAA/54-Golf%20Tournaments/mathgames_08_14_07.html. The first 6 days will work for you. —Victoria 32 golfers playing in foursomes for 10 days. This problem has been on the Social Golfer Problem page, in a 1998 sci.ops-research usenet posting, in mathpages.com, and in Google answers. Lots of wrong answers, unfortunately. The problem was first solved by Hao Shen in 1996, and independently solved by Charles Colbourn in 1999. In 2004, Alejandro Aguado came across the problem, and realized 4-RGDD (Resolvable Group Divisible Design) would solve the problem, and used Coulbourn's paper to produce "A 10 Days Solution to the Social Golfer Problem." In this solution, couples Aa-Oo all play once with everyone but their spouse.
| |||||||||||||||
|
|||||||||||||||
Math Central is supported by the University of Regina and the Imperial Oil Foundation. |