Home / Computer science / Traveling salesman problem (TSP) / Computation: Python, SAT + NN, permutation
Constraints: Rotational symmetry
Fix the first city to eliminate all rotations.
model.add(x[0] == x_[0])
N.B. There is also a reversal symmetry that is harder to define.