court balanced & minimum ways

[cecco]

Hello,

first of all, I'm sorry for my bad English...

I'm looking for an algorithm for even Teams and I hope you can help me. The problem is following...

If you have odd number of teams, every team plays against each other and moves only one court (Court A, B, C)
eg

A-B-C
x-1-2
5-4-3

A-B-C
x-5-1
4-3-2

A-B-C
x-4-5
3-2-1

A-B-C
x-3-4
2-1-5

A-B-C
x-2-3
1-5-4

If you have even number of teams, the first team always play's at court A. My Problem is, that also the first team should play on different courts... AND every team should only move one court forward. Is there any solution for that problem?

Thanks a lot!

[Ian Wakeling]

I don't know of any way to achieve what you want.  Note that the question of court balance when n is even is a hard problem, and there is no universal algorithm that works for all even n (see my notes here). So it is unlikely there is a single algorithm that can achieve both court balance and minimum movements.

[cecco]

Thank you for your quick answer. Maybe I have to find other solutions for that problem...
If there are 10 teams, I could add one dummy-team for the schedule....