Message from discussion Seeded tournament round robin algorithm
From: Borrall Wonnell <dbonn...@gmail.com>
Subject: Re: Seeded tournament round robin algorithm
Date: Tue, 15 Feb 2011 10:12:39 -0800 (PST)
Content-Type: text/plain; charset=ISO-8859-1
X-Trace: posting.google.com 1297793559 30201 127.0.0.1 (15 Feb 2011 18:12:39 GMT)
NNTP-Posting-Date: Tue, 15 Feb 2011 18:12:39 +0000 (UTC)
Injection-Info: y26g2000yqd.googlegroups.com; posting-host=18.104.22.168; posting-account=G70MGgoAAADR5ky9Ifst29QXrQfwmwRT
X-HTTP-UserAgent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US)
AppleWebKit/534.13 (KHTML, like Gecko) Chrome/9.0.597.98 Safari/534.13,gzip(gfe)
On Feb 15, 1:23=A0pm, Dann Corbit <dcor...@connx.com> wrote:
> That is the definition of a round robin tournament. =A0I suspect you want
> a swiss tournament, where the seeding matters (seeding is irrelevent in
> round-robin format).
The Swiss system is an option I plan on using where necessary, but it
doesn't make sense for a small number of players (in my case, n <=3D
8). I still want to use a round robin format in those situations.
You are correct: mathematically speaking, a round robin does not
depend on seeding. In practice this is not the case; order of play
matters when dealing with real people instead of numbers. As stated,
I'm looking to provide the 'easiest' match order for the #1 player,
followed by the 2nd easiest match order for the #2 player and so on.
That doesn't change the fact that it's a round-robin...it's merely a
subset of all possible solutions for a n-player round robin.
I guess the answer isn't as simple as I had hoped. Maybe I'll use a
table lookup after all :\
> Here you will find some sample programs for tournament scheduling:http://=
Thanks, I'll have a look to see if anything points me in the right