Welcome to the Monastery 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??

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

Create A New User
Node Status?
node history
Node Type: note [id://899976]
help
Chatterbox?
 [Discipulus]: if you hit the fan the cpu can overheat.. shmem fixed sporadic temperature watchdog resets on his laptop by cleaning the fan

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (9)
As of 2018-04-24 11:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
My travels bear the most uncanny semblance to ...

Results (85 votes). Check out past polls.

Notices?