Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question
"golf" ? "court" ? do you mean tennis ? or squash ? – Suresh Venkat Nov 13 '12 at 3:14
Perhaps course or links. – Dave Clarke Nov 13 '12 at 15:21

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.