Hi Kim.
I don't have a class to offer, but it might be helpful to put forward
the following simple algorithm as a start.
I know many people have wasted a lot of time on more complicated,
less effective solutions.
This is an excerpt from
http://www.devenezia.com/downloads/round-robin/sci.math.num-
analysis.round-robin
contributed by
From: [EMAIL PROTECTED] (Ron Shepard)
Newsgroups: sci.math.num-analysis
Subject: Re: RoundRobin tournament problem solvable?
Date: Mon, 03 Nov 1997 16:39:06 -0600
<partial quote follows>
The usual way of doing round robin competitions, say in a chess or
bridge tournament, is simply to line up the contestants facing each
other. Say there are 6 teams:
1 2 3
6 5 4
On the next round, one team stays fixed (say 6* in this example), and
the others rotate:
2 3 4
6* 1 5
On the next round it would be:
3 4 5
6* 2 1
and so on, for the 5 steps it takes for everyone to get back to where
they started. The contestants can rotate either clockwise, or
counterclockwise, it doesn't matter. And any one of them can stay
fixed, it doesn't matter. If there are an odd number of teams, then
just add a "dummy" team to get to an even number, and whoever faces
the dummy sits out that round; usually the dummy is the fixed-
position team, and the board is not set up for that position.
<end quote>
Russ
On May 29, 2006, at 9:07 AM, Kim Kohen wrote:
All,
i'm just wondering if anyone has created a class or method for
creating round robin type draws - something like you'd use to match
up tennis players or football teams etc where they each play every
other competitor in the tournament. Ideally, it would get
information from a database or flat file of names.
Just asking as I don't want to have to re-invent the wheel.
cheers and thanks
kim
_______________________________________________
Unsubscribe or switch delivery mode:
<http://www.realsoftware.com/support/listmanager/>
Search the archives of this list here:
<http://support.realsoftware.com/listarchives/lists.html>
