Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

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.

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

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://899981]
[Lady_Aleena]: None
[shmem]: I don't know geany, and don't know whether it has support for ctags.
[Lady_Aleena]: ctags?
[shmem]: ctags is a program which (recursively) extracts the symbols from source and stores them in a one-file database. This allows you to query the locations where these symbols (e.g. a subroutine name) are used anywhere in the source code tree...
[shmem]: ...from inside the editor.
[shmem]: apt-get install exuberant-ctags
[Lady_Aleena]: I think I heard vim has a big learning curve.
[shmem]: then in the root of your source tree run: ctags -R
[shmem]: you get a file named tags where all symbols and the places where they are used are listed

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (9)
As of 2017-04-27 12:09 GMT
Find Nodes?
    Voting Booth?
    I'm a fool:

    Results (505 votes). Check out past polls.