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

where equal strength is determined mostly by the performance in the tournament

So, by pretending to the algorithm that every match is a draw before anything is played, the part of the logic I have quoted rates everyone equally. Then the second part of the Swiss algorithm matches players of equal results within the tournament to be highest rank against lowest rank - exactly what the OP wants. Unless I've misunderstood something.

Regards,

John Davies

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

Replies are listed 'Best First'.
Re^8: Algorithm problem: Order matches by difference between players by JavaFan (Canon) on Apr 19, 2011 at 09:42 UTC
Eh, no. Swiss does order players by rank if they tie in score, but then splits the pile, and have the top of each pile play against each order. For instance, with 8 players, ranked from 1 to 8, the first round is pairs 1-5, 2-6, 3-7, 4-8. Also in Swiss, colour preferences are more important when pairing than ratings are. For details of the Swiss pairing rules, see FIDE Swiss Rules.	[reply]
Re^9: Algorithm problem: Order matches by difference between players by davies (Monsignor) on Apr 19, 2011 at 09:56 UTC
I agree about colour, but only in Chess, although that can be treated as Home/Away for some sports. I've certainly played in some Swiss tournaments that work as I described. I'm not surprised that there are many different interpretations, so whatever the OP wants, he would be wise to check that the code does what he wants before relying on it. Regards, John Davies	[reply]