in reply to Round robin tournament problem
A visually described algorithm:
Look at how A, B and C follow each other
Round 1Visualize the diffence between round 1 and 2 as A went where B was, B went where C was and C went where A was. The same replacement holds when you compare round 2 and 3.
Does not this "cylce" method also work with any even number? I think it does. Yea, I think it does.
If so then for any odd number of teams, add a team called "BYE" and you then have an even number of teams. Any team playing the "BYE" team, um, has a bye.
Example: Teams are A,B,C,D,E,F
Round 1Hope that helps.
Zenitram
|
---|
Replies are listed 'Best First'. | |
---|---|
Re: Re: Round robin tournament problem
by kelan (Deacon) on Oct 22, 2003 at 20:18 UTC |