WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Society cards · Eulerian path
Uncommon card · Society
Eulerian path, an Uncommon card
In graph theory, an Eulerian trail is a trail in a finite graph that visits every edge exactly once.
- Rarity
- Uncommon
- Domain
- Society
- ATK
- 70
- DEF
- 66
- Power
- 136
- Wikipedia reads a year
- 75,000
Power 136 (ATK + DEF): stronger than 75 % of WikiCards cards.
Eulerian path quiz: 3 questions
Three questions on the Eulerian path card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
Similarly, an Eulerian ______ or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex.
Answer
circuit. Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex. From the Eulerian path article on Wikipedia.
In which decade?
They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in ____.
Answer
1730s. They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736. From the Eulerian path article on Wikipedia.
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.
- Similarly, an Eulerian circuit or Eulerian cycle is an Eulerian trail that starts and ends on the same vertex.
- They were first discussed by Leonhard Euler while solving the famous Seven Bridges of Königsberg problem in 1736.
- The problem can be stated mathematically like this: Given the graph in the image, is it possible to construct a path that visits each edge exactly once?
Why it is Uncommon
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Eulerian path article was read about 75,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 70 and blocks with 66: each hit it takes is cut by 26 %.
How to get Eulerian 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 Society cards
Cards close in power
The cards just above and just below Eulerian path in the power ranking, all domains together.
- Josh WhiteUncommon · Arts · ATK 82 DEF 54
- Bolshoi TheatreUncommon · Arts · ATK 67 DEF 69
- DivinityUncommon · History · ATK 72 DEF 64
- Old World vultureUncommon · Nature · ATK 68 DEF 68
- AsparagaceaeUncommon · Nature · ATK 69 DEF 67
- AntipaterUncommon · History · ATK 70 DEF 66
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, Eulerian path (revision), CC BY-SA 4.0. Photo : Cmglee, Public domain, Wikimedia Commons.
