Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site ucbvax.BERKELEY.EDU
Path: utzoo!decvax!bellcore!ulysses!ucbvax!works
From: MCGRATH%OZ.AI.MIT.EDU@MIT-XX.ARPA ("Jim McGrath")
Newsgroups: mod.computers.workstations
Subject: Tournament Design Query
Message-ID: <8601230742.AA21922@ucbvax.berkeley.edu>
Date: Wed, 22-Jan-86 20:43:17 EST
Article-I.D.: ucbvax.8601230742.AA21922
Posted: Wed Jan 22 20:43:17 1986
Date-Received: Fri, 24-Jan-86 03:14:03 EST
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 20
Approved: works@red.rutgers.edu


    From: Jacob_Palme_QZ%QZCOM.MAILNET@MIT-MULTICS.ARPA

    I have a programming problem I have not been able to solve.
    Perhaps someone else has already solved it?

    My problem is that I want to make a plan for a league of teams to
    play e.g. soccer or ice-hockey.

    Such a league consists of an even number of teams, between 4 and
    18 teams in a league. Each team is to meet each other team twice,
    one at home and one at home of the other team....

See Aho, Hopcroft, and Ullann.  Data Structures and Algorithms.
Addison-Wesley, 1983.  On page 310 they discuss an algorithm for
constructing a round robin tennis tournament schedule.  It should be
easy to adapt it for your problem.


Jim