WikiCardsPlay now

The Wikipedia card gamestudio IVRYN

Play on iPhone nowFree in Safari. Add it to your Home Screen.Play

WikiCards · Card list · Science cards · Level ancestor problem

Common card · Science

Level ancestor problem, a Common card

In graph theory and theoretical computer science, the level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a given node at a given distance from the root of the tree.

From the Wikipedia article

Rarity
Common
Domain
Science
ATK
53
DEF
25
Power
78
Wikipedia reads a year
1,200

Power 78 (ATK + DEF): stronger than 35 % of WikiCards cards.

Play nowGet it onGoogle PlayFree, no ads, no account needed. Android only for now: the iPhone version is in review at Apple.

The facts on the card

The card carries these facts from its Wikipedia article.

Why it is Common

Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Level ancestor problem article was read about 1,200 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 53 and blocks with 25: each hit it takes is cut by 10 %.

How to get Level ancestor 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 Science cards

Cards close in power

The cards just above and just below Level ancestor problem in the power ranking, all domains together.

Card lists

Credits

Text : Wikipedia, Level ancestor problem (revision), CC BY-SA 4.0. Photo : Vafakhoshaein, CC BY-SA 3.0, Wikimedia Commons.

WikiCardsThe Wikipedia card gameInstall