Math Senior Project: Golf Scheduling Problem

Consider a golf tournament in which twelve players split up into three groups of four to play five rounds. (Groups can be different in each round.) Is it possible for each player to play in a group with each other player at least once, but no more than twice? We explore and expand this problem, presenting computer algorithms and mathematical results.

In general, a golf schedule has x people per group, y groups, z rounds, and r times each player plays with each other one.  In the motivating problem discussed above we have x=4, y=3, z=5, and 1? r? 2.

Full Text (pdf)