Tournois et Sage

[[(11, 7, 5), (14, 12, 8), (13, 6, 3), (10, 9, 2), (4, 1, 0)],
 [(13, 12, 11), (8, 3, 1), (6, 5, 2), (14, 10, 4), (9, 7, 0)],
 [(11, 10, 3), (12, 5, 0), (13, 9, 1), (14, 7, 2), (8, 6, 4)],
 [(11, 9, 4), (13, 8, 2), (12, 7, 3), (10, 6, 0), (14, 5, 1)],
 [(12, 10, 1), (3, 2, 0), (14, 11, 6), (9, 8, 5), (13, 7, 4)],
 [(7, 6, 1), (13, 10, 5), (14, 9, 3), (12, 4, 2), (11, 8, 0)],
 [(12, 9, 6), (14, 13, 0), (10, 8, 7), (11, 2, 1), (5, 4, 3)]]

E = 15  # équipes
T = [(i,j,k) for i in range(2,15) for j in range(1,i) for k in range(j)]
L = 5   # lieux
D = 7   #dates
pb = MixedIntegerLinearProgram()
# déclaration d'un tableau d'inconnues à valeurs dans {0,1}
# sens : A[t,l,d] = 1 ssi à la date d, les trois équipes du triplet t s'affrontent dans le lieu l
A  = pb.new_variable(binary=True)

for d in range(D):
    for l in range(L):
        pb.add_constraint(add(A[t,l,d] for t in T)<=1)
    for i in range(E):
        pb.add_constraint( add(A[t,l,d] for l in range(L) for t in T if i in t) <=1 )

for i in range(E):
    for j in range(E):
        pb.add_constraint(add( add(A[(i,j,k),l,d] for k in range(j)) \
                             + add(A[(i,k,j),l,d] for k in range(j+1,i)) \
                             + add(A[(k,i,j),l,d] for k in range(i+1,E)) for l in range(L) for d in range(D)) ==1 )
pb.solve()
A = pb.get_values(A)
def f(l,d):
    return [t for t in T if A[t,l,d]==1][0]

[[f(l,d) for l in range(L)] for d in range(D)]