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
In reply to Re^5: Algorithm problem: Order matches by difference between players
by davies
in thread Algorithm problem: Order matches by difference between players
by Dirk80
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |