Turn Sanskrit metre patterns into a computational counting problem. Discover how enumeration, recurrence and combinations reduce an apparently huge search space.
Your objectiveCount patterns or combinations exactly while avoiding unnecessary enumeration.
How to playModel → execute → test → audit → optimize. A correct result can still be inefficient.
Historical lensPiṅgala’s prosodic tradition and later Meru-prastāra provide the historical lens; the modern extensions are combinatorics and algorithms.
Score 0Streak 0
Generate the search space mentally, then use the Meru-style recurrence or binomial reasoning to compress the work.
Choose a counting strategy.
Modern bridge: enumeration becomes recursion, binomial coefficients, binary state spaces and algorithmic search.
Source and scope: Modern historical scholarship traces formal combinatorial procedures in India to Sanskrit prosody and Piṅgala's Chandaḥsūtra; later traditions developed Meru-prastāra. The exact attribution of every later Meru formulation is debated, so the game describes it as a developing prosodic tradition rather than a single inventor claim.
