What does Formalising Founder Wishes conclude, in numbers, about “The Minimum Runnable Prototype: Kano Classes and the Knapsack”?
Answer: With 15 days left in the budget, knapsack dynamic programming chooses a combination worth 37, one point more than the greedy method. The budget curve shows the marginal value falling to 1.00 a day after 28 days, which sets the upper limit of the minimum prototype. Among 40 Kano questionnaires, the reviews feature, set up with one-dimensional quality in the lead, was classified as indifferent, which shows that a classification must state its lead and its sample size. "The later, the dearer" is not a law; the reason for small prototypes is that they let the business learn early.
Scope of the numbers: Amounts are in illustrative units with no currency, parameters are illustrative, and all calculations are generated by the book's programs. The book is non-personalised business guidance, not personal financial or investment advice; the psychological literature is reported only as associations with their conditions, and the lower end of an interval is never a promise of income.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 15, 37
| budget 23 days; must-be features take 8; 15 left | |
| DP pick value | 37: bundle price, reviews, sample chapter, search |
| greedy value | 36: bundle price, reading list, reviews, sample chapter |
| dropped as indifferent: dark mode |
Show the full program
# Chapter 6. p61: smallest acceptable prototype as a 0-1 knapsack
# Features of a direct book-sales prototype with Kano class, build cost
# in days and a value score (all illustrative). Must-be (M) features are
# forced in, indifferent (I) ones are dropped, and dynamic programming
# picks the best one-dimensional (O) and attractive (A) set for the
# remaining days. Greedy by value per day is shown for comparison.
FEATS = [
("catalogue page", "M", 3, 0), ("checkout", "M", 4, 0),
("order email", "M", 1, 0), ("sample chapter", "O", 2, 9),
("bundle price", "O", 3, 8), ("search", "O", 4, 7),
("reading list", "A", 3, 6), ("gift note", "A", 2, 3),
("reviews", "O", 6, 13), ("dark mode", "I", 2, 0),
("wish list", "A", 4, 5), ("referral link", "A", 3, 4),
]
BUDGET = 23
forced = [f for f in FEATS if f[1] == "M"]
pool = [f for f in FEATS if f[1] in "OA"]
left = BUDGET
for f in forced:
left -= f[2]
best = [[0] * (left + 1) for _ in range(len(pool) + 1)]
for i, (_, _, w, v) in enumerate(pool, 1):
for b in range(left + 1):
best[i][b] = best[i - 1][b]
if w <= b and best[i - 1][b - w] + v > best[i][b]:
best[i][b] = best[i - 1][b - w] + v
pick, b = [], left
for i in range(len(pool), 0, -1):
if best[i][b] != best[i - 1][b]:
pick.append(pool[i - 1])
b -= pool[i - 1][2]
greedy, g_left, g_val = [], left, 0
for f in sorted(pool, key=lambda f: (-f[3] / f[2], f[0])):
if f[2] <= g_left:
greedy.append(f)
g_left -= f[2]
g_val += f[3]
print("budget {} days; must-be features take {}; {} left".format(
BUDGET, BUDGET - left, left))
print("DP pick value {:>3}: {}".format(
best[len(pool)][left], ", ".join(sorted(f[0] for f in pick))))
print("greedy value {:>3}: {}".format(
g_val, ", ".join(sorted(f[0] for f in greedy))))
print("dropped as indifferent: {}".format(
", ".join(f[0] for f in FEATS if f[1] == "I")))Single source and citation
Fan, Y. (2026). Formalising Fuzzy Founder Wishes: Constraint Inversion, Falsifiable Spec Synthesis and Executable Revenue System Compilation (Version 1.0.0), Chapter 6: The Minimum Runnable Prototype: Kano Classes and the Knapsack. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-414 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026414,
author = {Fan, Yafu},
title = {Formalising Fuzzy Founder Wishes: Constraint Inversion, Falsifiable Spec Synthesis and Executable Revenue System Compilation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Obstacles First: Positive Fantasy, Mental Contrasting and the First Step of Compilation
- Chapter 2 · Five Slots: Counting Readings, Recording Rulings and Separating the Optative from the Indicative
- Chapter 3 · Constraint Inversion: Weakest Preconditions, Elimination and Arc Consistency
- Chapter 4 · Break-Even Floors and the Probability of Reaching a Target: Intervals, Not Points
- Chapter 5 · Counterexamples First: Property-Based Testing, Shrinking and the Minimal Contradictory Subset
- Chapter 7 · The Classics Examined: Preparedness, the Man of Zheng and Descartes' Second Rule
- Chapter 8 · Field Tools and Checker Specifications: The Wish Ledger, Red Lines and a Pre-Registered Test