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

Obviously I haven't been clear enough. I appreciate that the OP wants a round robin, but a Swiss with N players and N-1 rounds gives you that (unless you allow replays, which can be allowed in some Swiss events). By telling the Swiss algorithm that every match is a draw before they are played, you will get a schedule that will achieve what I understand the OP to want. While I accept that your proposal will work fine for the first round, I'm not clear how you would get a generic process for the later rounds that would prevent 1 playing 2 until the last round. I believe that the Swiss algorithm would achieve that.

It's possible that I'm still not clear. It's late enough for me to want my bed, so please let me know if I'm not & I'll try to do better tomorrow.

Regards,

John Davies

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

Replies are listed 'Best First'.
Re^6: Algorithm problem: Order matches by difference between players by JavaFan (Canon) on Apr 18, 2011 at 22:55 UTC
No, the Swiss system will actually optimize that people of equal strength play against each other as soon as possible - where equal strength is determined mostly by the performance in the tournament. That is, if I win the first three rounds, I will play against someone else who has won in the first three rounds (unless I'm the odd one out, in which I most likely play against someone with 2.5/3).	[reply]
Re^7: Algorithm problem: Order matches by difference between players by davies (Monsignor) on Apr 19, 2011 at 06:25 UTC
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	[reply]
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