📚 Curriculum Coverage Lab: Set Cover, Greedy Lesson Choice and the ln n Guarantee
A curriculum-design lab built on the set-cover problem: pick the cheapest set of lessons that covers every learning outcome. Greedy selection versus the brute-force optimum, the harmonic-number guarantee and a classic adversarial instance. Educational model.
⚙ Under the hood
A curriculum-design lab built on the set-cover problem: pick the cheapest set of lessons that covers every learning outcome. Greedy selection versus the brute-force optimum, the harmonic-number guarantee and a classic adversarial instance. Educational model.
Curriculum DesignSet CoverGreedy AlgorithmOptimisationLearning Outcomes
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install