Турнирная таблица

pls = list(range(1, 37))
for i in range(35):
    print(f'{i+1} день')
    for k in range(4):
        print(pls[k*9:k*9+9])
    print()
    pls = [pls[0]] + pls[2:] + [pls[1]]
    #pls.append(pls.pop(1))

from collections import defaultdict
from pprint import pprint
import itertools
 
def stat(schedule):
 pair_counts = defaultdict(lambda: 0)
 gamers = set()
 for day_schedule in schedule:
 for tab in day_schedule:
 for i in tab:
 gamers.add( i )
 for i, j in itertools.product(tab,tab):
 if i < j:
 pair_counts[(i,j)] += 1
 
 counts = defaultdict(lambda: 0)
 for i, j in itertools.product(gamers, gamers) :
 if i < j:
 counts[pair_counts[(i,j)]] += 1
 max_ = max(counts.keys())
 min_ = min(counts.keys())
 L0 = sum((v for n, v in counts.items()))
 L1 = sum((v*n for n, v in counts.items()))
 L2 = sum((v*n*n for n, v in counts.items()))
 return {"max-min":max_-min_, "sqr-deviation": (L2/L0 - (L1/L0)**2)**0.5, "counts": sorted(counts.items()) }
 
def day_schedule_by_miller_index(miller_index):
 i1, i2, i3 = miller_index
 ret = [[], [], []]
 for g in range(27):
 s = ( i1*((g//1)%3)
 + i2*((g//3)%3)
 + i3*((g//9)%3)
 )%3
 ret[s] += [g]
 return ret
 
def schedule_by_miller_index():
 """generate ideal 13-days schedule"""
 # return [ day_schedule_by_miller_index(miller)
 # for miller in [ (0,0,1), (0,1,0), (1,0,0),
 # (0,1,1), (1,1,0), (1,0,1),
 # (0,1,2), (1,2,0), (2,0,1),
 # (1,1,2), (1,2,1), (2,1,1),
 # (1,1,1) ] ]
 return [day_schedule_by_miller_index((i1,i2,i3))
 for i1, i2, i3 in itertools.product(range(3), range(3), range(3))
 if (i1, i2, i3) != (0, 0, 0) and (i1, i2, i3) < (i1 * 2 % 3, i2 * 2 % 3, i3 * 2 % 3) ]
 
def multidays_schedule_by_miller_index(days = 24):
 ret = []
 while len(ret) < days:
 ret += schedule_by_miller_index()
 return ret[0:days]
 
schedule=multidays_schedule_by_miller_index(24)
pprint(schedule)
pprint(stat(schedule))