WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Society cards · Travelling salesman problem
Rare card · Society
Travelling salesman problem, a Rare card
In the theory of computational complexity, the travelling salesman problem 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 NP-hard problem in…
- Rarity
- Rare
- Domain
- Society
- ATK
- 84
- DEF
- 84
- Power
- 168
- Wikipedia reads a year
- 270,000
Power 168 (ATK + DEF): stronger than 85 % of WikiCards cards.
Travelling salesman problem quiz: 3 questions
Three questions on the Travelling salesman problem card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
The ______ version of the TSP belongs to the class of NP-complete problems.
Answer
decision. The decision version of the TSP belongs to the class of NP-complete problems. From the Travelling salesman problem article on Wikipedia.
Which of these cards hits hardest (highest ATK)?
Answer
Lviv. Lviv 95 · Bakersfield, California 90 · Travelling salesman problem 84 · Oscar Robertson 80 ATK in WikiCards.
In a duel, each round asks a question like these about the opposing card, with 15 seconds to answer.
The facts on the card
The card carries these facts from its Wikipedia article.
- The travelling purchaser problem, the vehicle routing problem and the ring star problem are three generalizations of TSP.
- The decision version of the TSP belongs to the class of NP-complete problems.
- Thus, it is possible that the worst-case running time for any algorithm for the TSP increases superpolynomially with the number of cities.
Why it is Rare
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Travelling salesman problem article was read about 270,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 84 and blocks with 84: each hit it takes is cut by 34 %.
How to get Travelling salesman problem
Open packs. Each pack holds five cards drawn from real Wikipedia articles, the rarest last, and the fifth card is always Rare or better. The odds are shown in the game. A free pack arrives every hour and two can wait, and the Coins you win in duels buy more packs.
More Society cards
Cards close in power
The cards just above and just below Travelling salesman problem in the power ranking, all domains together.
- GraniteRare · Arts · ATK 79 DEF 89
- José Antonio ReyesRare · Society · ATK 80 DEF 88
- Phillip PhillipsRare · Arts · ATK 79 DEF 89
- Brent FaiyazRare · Arts · ATK 78 DEF 90
- Denis LawRare · Society · ATK 80 DEF 88
- Dmitri MendeleevRare · Science · ATK 78 DEF 90
Card lists
- Wikipedia quizNew questions every day
- All cards from A to ZEvery card, by name
- Society cards
- Legendary cards
- Tier listS and A tiers by power (ATK + DEF)
Credits
Text : Wikipedia, Travelling salesman problem (revision), CC BY-SA 4.0. Photo : Xypron, Public domain, Wikimedia Commons.
