WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Science cards · Knapsack problem
Uncommon card · Science
Knapsack problem, an Uncommon card
The knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.
- Rarity
- Uncommon
- Domain
- Science
- ATK
- 76
- DEF
- 61
- Power
- 137
- Wikipedia reads a year
- 150,000
Power 137 (ATK + DEF): stronger than 75 % of WikiCards cards.
Knapsack problem quiz: 3 questions
Three questions on the Knapsack problem card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
The knapsack problem has been ______ for more than a century, with early works dating back to 1897.
Answer
studied. The knapsack problem has been studied for more than a century, with early works dating back to 1897. From the Knapsack problem article on Wikipedia.
Which of these cards hits hardest (highest ATK)?
Answer
Trombone. Trombone 82 · Knapsack problem 76 · Electronics 71 · Hottest chili pepper 63 ATK in WikiCards.
Which of these Wikipedia articles is read the most in a year?
Answer
Electronics. Electronics 230,000 · Knapsack problem 150,000 · Quantum chromodynamics 120,000 · Angioplasty 92,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.
- It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
- The problem often arises in resource allocation where the decision-makers have to choose from a set of non-divisible projects or tasks under a fixed budget or time constraint, respectively.
- The knapsack problem has been studied for more than a century, with early works dating back to 1897.
Why it is Uncommon
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Knapsack problem article was read about 150,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 76 and blocks with 61: each hit it takes is cut by 24 %.
How to get Knapsack 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 Knapsack problem in the power ranking, all domains together.
- Bob Marley and the WailersUncommon · Arts · ATK 73 DEF 64
- ClimateUncommon · Society · ATK 73 DEF 64
- Hottest chili pepperUncommon · Science · ATK 63 DEF 74
- TromboneUncommon · Arts · ATK 82 DEF 55
- United States customary unitsUncommon · Science · ATK 75 DEF 62
- Alexis of RussiaUncommon · History · ATK 69 DEF 68
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, Knapsack problem (revision), CC BY-SA 4.0. Photo : VectorVoyager, CC BY-SA 4.0, Wikimedia Commons.
