Super rare card
Travelling salesman problem
- Value
- 200 W
- Attack
- 312
- Defence
- 250
- Players
- 0
In the theory of computational complexity, the travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an…
Get Travelling salesman problem in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack