Travelling Salesman
Costs
New
Solve
Show search flow
Your browser does not support the canvas element.
1
2
3
4
5
6
7
8
9
Map size
Average connections
Symmetric
Method
Simulated Annealing
Combinatorial
Greedy Depth-First Search
Simulated Annealing Params
T max
T min
T factor
E
Info
You are a traveling salesman that must visit every city once and then return to the starting point A. The goal is to find the shortest possible route that accomplishes this.