Root-finding algorithm, an Uncommon card

The card carries these facts from its Wikipedia article.

• A root of the function f is a number x such that f = 0.
• As the zeros typically cannot be computed exactly, nor expressed in closed form, root-finding algorithms provide approximations to the zeros.
• The functions considered are typically continuous or, for most algorithms, differentiable.

Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Root-finding algorithm article was read about 30,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 62 and blocks with 35: each hit it takes is cut by 14 %.

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.

The cards just above and just below Root-finding algorithm in the power ranking, all domains together.