<p>This is a problem I ran across recently while trying to schedule classes which I thought might be interesting theoretically.</p>

<p>Given <code>k</code> golfers who want to play on <code>m</code> courts for <code>n</code> weeks, is it possible to arrange groups of golfers of fixed size <code>s</code> (where <code>s</code> can possibly be smaller than <code>m/k</code>) such that every golfer plays on every court, and every golfer plays every week?</p>

<p>I'm actually trying to solve this for k=24, m=n=7, s=6</p>

<p>Is there an equivalent or similar problem I should look at?  Is there a way to solve this for small <code>n</code> so I can get my personal version done in time for the classes?</p>

CC BY-SA 3.0
2012-11-13T03:14:29.493Z
"golf" ? "court" ? do you mean tennis ? or squash ?
Suresh Venkat
CC BY-SA 3.0
2012-11-13T15:21:23.880Z
Perhaps course or links.
Dave Clarke
<co.combinatorics>
Variation on Social Golfers
Zachary Vance
# Variation on Social Golfers

(Asked by: username_0 on 2012-11-13)

This is a problem I ran across recently while trying to schedule classes which I thought might be interesting theoretically.

Given `k` golfers who want to play on `m` courts for `n` weeks, is it possible to arrange groups of golfers of fixed size `s` (where `s` can possibly be smaller than `m/k`) such that every golfer plays on every court, and every golfer plays every week?

I'm actually trying to solve this for k=24, m=n=7, s=6

Is there an equivalent or similar problem I should look at? Is there a way to solve this for small `n` so I can get my personal version done in time for the classes?

**Tags:** co.combinatorics

> **Comments:**
> **username_1**: "golf" ? "court" ? do you mean tennis ? or squash ?  
> **username_2**: Perhaps course or links.  

---

## 0 answers

