Untitled

optimum = 1e10

for o in range(1, 15):
    if A[0, o] == None:
        continue
    for a in tqdm(range(1, 15)):
        if A[o, a] == None or a == o:
            continue 
        for b in range(1, 15):
            if A[a, b] == None or b == o or b == a:
                continue
            for c in range(1, 15):
                if A[b, c] == None or c == o or c == a or c == b:
                    continue
                for d in range(1, 15):
                    if A[c, d] == None or d == o or d == a or d == b or d == c:
                        continue
                    for e in range(1, 15):
                        if A[d, e] == None or e == o or e == a or e == b or e == c or e == d:
                            continue
                        for f in range(1, 15):
                            if A[e, f] == None or f == o or f == a or f == b or f == c or f == d or f == e:
                                continue
                            for g in range(1, 15):
                                if A[f, g] == None or g == o or g == a or g == b or g == c or g == d or g == e or g == f:
                                    continue
                                for h in range(1, 15):
                                    if A[g, h] == None or h == o or h == a or h == b or h == c or h == d or h == e or h == f or h == g:
                                        continue
                                    for i in range(1, 15):
                                        if A[h, i] == None or i == o or i == a or i == b or i == c or i == d or i == e or i == f or i == g or i == h:
                                            continue
                                        for j in range(1, 15):
                                            if A[i, j] == None or j == o or j == a or j == b or j == c or j == d or j == e or j == f or j == g or j == h or j == i:
                                                continue
                                            for k in range(1, 15):
                                                if A[j, k] == None or k == o or k == a or k == b or k == c or k == d or k == e or k == f or k == g or k == h or k == i or k == j:
                                                    continue
                                                for l in range(1, 15):
                                                    if A[k, l] == None or l == o or l == a or l == b or l == c or l == d or l == e or l == f or l == g or l == h or l == i or l == j or l == k:
                                                        continue
                                                    for m in range(1, 15):
                                                        if A[l, m] == None or m == o or m == a or m == b or m == c or m == d or m == e or m == f or m == g or m == h or m == i or m == j or m == k or m == l:
                                                            continue
                                                        if A[0, m] == None:
                                                            continue
                                                        sum = A[0, o] + A[o, a] + A[a, b] + A[b, c] + A[c, d] + A[d, e] + A[e, f] + A[f, g] + A[g, h] + A[h, i] + A[i, j] + A[j, k] + A[k, l] + A[l, m] + A[0, m]
                                                        if sum < optimum:
                                                            optimum = sum
                                                            counter = 0
                                                            list = [o, a, b, c, d, e, f, g, h, i, j, k, l, m]
                                                        elif sum == optimum:
                                                            counter += 1
                                                            list_sup = [o, a, b, c, d, e, f, g, h, i, j, k, l, m]

print(list)
print(list_sup)
print(optimum)