夹具调度是一个众所周知的问题。这是算法的python实现，网址为：http : //en.wikipedia.org/wiki/Round-
robin_tournament
# generation pre - for cut and pasteimport operatordef fixtures(teams): if len(teams) % 2: teams.append('Day off') # if team number is odd - use 'day off' as fake team rotation = list(teams) # copy the list fixtures = [] for i in range(0, len(teams)-1): fixtures.append(rotation) rotation = [rotation[0]] + [rotation[-1]] + rotation[1:-1] return fixtures# demo preteams = ["Team1", "Team2", "Team3", "Team4", "Team5"]# for one match each - use this block onlymatches = fixtures(teams)for f in matches: print zip(*[iter(f)]*2)# if you want return matches reverse_teams = [list(x) for x in zip(teams[1::2], teams[::2])]reverse_teams = reduce(operator.add, reverse_teams) # swap team1 with team2, and so on ....#then run the fixtures againmatches = fixtures(reverse_teams)print "return matches"for f in matches: print f生成输出：
[('Team1', 'Day off'), ('Team2', 'Team5'), ('Team3', 'Team4')][('Team1', 'Team5'), ('Day off', 'Team4'), ('Team2', 'Team3')][('Team1', 'Team4'), ('Team5', 'Team3'), ('Day off', 'Team2')][('Team1', 'Team3'), ('Team4', 'Team2'), ('Team5', 'Day off')][('Team1', 'Team2'), ('Team3', 'Day off'), ('Team4', 'Team5')]
