Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re: Re: Round robin tournament problem

by kelan (Deacon)
on Oct 22, 2003 at 20:18 UTC ( #301354=note: print w/replies, xml ) Need Help??


in reply to Re: Round robin tournament problem
in thread Round robin tournament problem

Here's a function that implements this logic. You pass it the number of players and the round number and it returns a list of numbers. Each pair of numbers is a matchup for that round. (A pair of say 1,4 means "Player 1 plays Player 4".)

# Function for determining the matchups in a round-robin # tournament round, given the number of players and the # round number. sub matchups { my $players = shift; my $round = shift; # Sanity check the round number if ($round < 1 || $round > $players-1) { return; } my @list = (1, 1+$round .. $players, 2 .. $round); my @pairs; for (0 .. $#list / 2) { push @pairs, $list[$_], $list[$players-1 - $_]; } return @pairs; }
If there are an odd number of players, the last pair will be the same number twice (meaning "Player 4 plays Player 4"), which is essentially a bye.

kelan


Perl6 Grammar Student

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://301354]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (3)
As of 2019-10-21 05:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?