A puzzle...

[sheenaqotj]

I'm running a 6-team round-robin tournament. Here is a sample schedule, with the columns representing fields and the rows representing game numbers, but you don't have to use it as long as the constraints are satisfied (i.e. every team plays every other within the 5 rounds

Comments

[rupes]

The lower bound appears to be 12 moves (4 transitions * 3 moves/transition), but I don't think that actually works - I always end up unable to conduct at least one match. I think you're going to have to stick one team with three moves.

[sheenaqotj]

Do you have a combo with one team having 3 moves? Please post it!

[jwildstr]

I don't know if this is optimal, but I permuted yours a bit:

1 v 5 2 v 4 3 v 6
2 v 5 1 v 6 3 v 4
2 v 3 5 v 6 1 v 4
2 v 6 4 v 5 1 v 3
4 v 6 3 v 5 1 v 2

Every game is followed by one of the teams sticking around on their field. Moves by round (i.e., team moves after round i):
1: 2, 3
2: 1, 4
3: 2, 3, 4
4: 1, 3, 4
5: 2
6: 1, 3

5 gets to be the lucky team and only move once, but no-one moves more than 3 times (i.e., they have at least one pair of games on the same field. It MIGHT be possible to find one where one team moves 3 times and everyone else moves twice, but I've got other things to do :)

[skydiamonde]

Are the teams seeded at all? For round robins, I'm used to initial seeding indicating how many times you have to move fields...

[sheenaqotj]

Assume everything is equal.

[zml]

I told her to do it by registration order. :)