From: Martin DeMello <martindemello@...>
Date: 2006-08-31T16:35:48+09:00
Subject: Re: Pairs tournament algorithm

On 8/31/06, Ben Nagy <ben@iagu.net> wrote:
> > -----Original Message-----
> > From: list-bounce@example.com
> > [mailto:list-bounce@example.com] On Behalf Of Christer Nilsson
> > Sent: Wednesday, August 30, 2006 11:19 PM
> > To: ruby-talk ML
> > Subject: Re: Pairs tournament algorithm
> >
> > This is a system, mainly used by chess players, called Monrad.
> >
> > Example: 100 players, 10 rounds.
> >
> > The players are sorted according to their score, after every round.
> > Players are paired from the top.
> > Two players can only meet once.
>
> They use this kind of this in Bridge tournaments as well, but call it a
> "Swiss". Swiss systems work well for a very rough sort, but there are two
> main issues.

Scrabble too, where it's known variously as "Australian Draw" and
"King of the Hill with no repeats"

martin