Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Algorithm problem: Order matches by difference between players

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


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

Ok, more thoughts... the odd case is trivial in the algorithmic sense. The pattern I've printed previously for N=7 should work for any odd N. The first half of the field of the even case is also trivial in the algorithmic sense. Player 1 will always have N-1 .. 2, Player 2 will be N-2 to 3, N-1, 1, Player 3 will be N-3 .. (N-1) .. 1, N-2, N-3 .. and all other players from 4 down to N/2 will be the same.

The second half of the even case gets complicated, because in manual tests of the case of 8 I saw situations where patterns had to be adjusted because of prior use of a pairing.

David.


Comment on Re: 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://899981]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (6)
As of 2015-07-05 10:51 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (61 votes), past polls