From: Christer Nilsson Date: 2006-08-31T01:18:43+09:00 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. The clever reader should here realize the fact that backtracking sometimes is necessary at the end of the list. ----------------- There is another system called Blocksort, used at least once in a big table-tennis tournament. If A beats B and B beats C, then A is considered to beat C as well. The problem with this approach is: you don't know how many rounds are needed. ----------------- Maybe this is something for Ruby Quiz? -- Posted via http://www.ruby-forum.com/.