Home / Computer science / Traveling salesman problem (TSP) / Computation: Python, SAT + NN, permutation
Hint
x_ = [22, 21, 20, 24, 23, 45, 44, 43, 47, 46, 68, 67, 66, 49, 48, 51, 52, 53, 41, 42, 27, 28, 29, 30
, 18, 19, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 36, 35, 34, 33, 39, 40, 59, 58
, 57, 56, 62, 63, 61, 60, 54, 55, 50, 65, 64, 70, 71, 72, 38, 37, 31, 32, 26, 25, 3, 2, 1, 0
, 74, 75, 73, 69]
for i in range(n):
j = (i + 1) % n
model.add_hint(x[i], x_[i])
model.add_hint(s[i], x_[i] * n + x_[j])
model.add_hint(t[i], d[x_[i]][x_[j]])
None