Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re^2: Algorithm problem: Order matches by difference between players

by dwm042 (Priest)
on Apr 18, 2011 at 16:32 UTC ( #899976=note: print w/ replies, xml ) Need Help??


in reply to Re: Algorithm problem: Order matches by difference between players
in thread Algorithm problem: Order matches by difference between players

On odd sizes, if you allow for the person whose "#", so to speak, has turned up to have a 'bye', then I suspect it works pretty well.

In other words, if player 2 in a 7 player tournament has a bye in round 5, player 3 a bye in round 3 and player 4 a bye in round 1, and writing code to allow byes in odd sized tourneys, the same kind of logic as in the even case should fit.

This chart might explain it better:

1: 7-6-5-4-3-2
2: 6-5-4-3-B-1
3: 5-4-B-2-1-7
4: B-3-2-1-7-6
5: 3-2-1-7-6-B
6: 2-1-7-B-5-4
7: 1-B-6-5-4-3


David.


Comment on Re^2: Algorithm problem: Order matches by difference between players

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (6)
As of 2014-11-23 00:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (125 votes), past polls