WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Science cards · Hamiltonian path
Uncommon card · Science
Hamiltonian path, an Uncommon card
In the mathematical field of graph theory, a Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once.
- Rarity
- Uncommon
- Domain
- Science
- ATK
- 63
- DEF
- 43
- Power
- 106
- Wikipedia reads a year
- 71,000
Power 106 (ATK + DEF): stronger than 60 % of WikiCards cards.
Hamiltonian path quiz: 3 questions
Three questions on the Hamiltonian path card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
A Hamiltonian cycle is a cycle that ______ each vertex exactly once.
Answer
visits. A Hamiltonian cycle is a cycle that visits each vertex exactly once. From the Hamiltonian path article on Wikipedia.
Which of these Wikipedia articles is read the most in a year?
Answer
Low Earth orbit. Low Earth orbit 280,000 · Pigpen cipher 180,000 · Sabine Hossenfelder 130,000 · Hamiltonian path 71,000 Wikipedia reads over a year.
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.
- A Hamiltonian cycle is a cycle that visits each vertex exactly once.
- A Hamiltonian path that starts and ends at adjacent vertices can be completed by adding one more edge to form a Hamiltonian cycle, and removing any edge from a Hamiltonian cycle produces a Hamiltonian path.
- The computational problems of determining whether such paths and cycles exist in graphs are NP-complete, see Hamiltonian path problem for details.
Why it is Uncommon
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Hamiltonian path article was read about 71,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 63 and blocks with 43: each hit it takes is cut by 17 %.
How to get Hamiltonian path
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 Science cards
Cards close in power
The cards just above and just below Hamiltonian path in the power ranking, all domains together.
- BastionUncommon · Arts · ATK 56 DEF 50
- BestiaryUncommon · Arts · ATK 65 DEF 41
- Hyundai Gamma engineUncommon · Science · ATK 62 DEF 44
- Charlie DalinUncommon · Society · ATK 59 DEF 47
- Karakum DesertUncommon · Nature · ATK 57 DEF 49
- Abbas ibn Abd al-MuttalibUncommon · History · ATK 58 DEF 48
Card lists
- Wikipedia quizNew questions every day
- All cards from A to ZEvery card, by name
- Science cards
- Legendary cards
- Tier listS and A tiers by power (ATK + DEF)
Credits
Text : Wikipedia, Hamiltonian path (revision), CC BY-SA 4.0. Photo : Eyesinthefire, CC BY-SA 4.0, Wikimedia Commons.
