๐ŸŽฎ Game Design & Interactive Media ยท narrative branching

Likeness Branching

Compare narrative branching candidates by quantum fidelity so designers pick the closest match in one tap.

SWAP testยท similarity
Section ยท Quantum

The hook.

full primer โ†’

Two narrative branching candidates go into a quantum similarity check; the app shows game designers a single 0โ€“100% match score so they can pick the closest one in a tap.

Why this primitiveSWAP test is the right primitive here because narrative branching reduces to a similarity problem; the kernel returns a result you can drop straight into the UI.

Kernel
a 2-register SWAP-test kernel returning fidelity in [0,1] between two amplitude-encoded vectors
Drives the UI as
a similarity score (0-100%) and a 'closest match' surface
Appendix A

The mega-prompt.

This prompt is engineered to ship in a single Lovable build. Real Quantinuum Guppy/Selene circuit runs in the Linux sandbox at build time and the results are baked in as JSON. read the build strategy โ†’

~14.5 KB287 lines1 msg ยท ~5 credits
Open in Lovable โ†—
Appendix B

Market sizing.

TAM
$23.0B
the game industry (~$200B) and >3M indie developers.
SAM
$5.3B
the 23% of that market actively buying narrative branching-adjacent software.
SOM
$159M
a realistic 3% capture of the serviceable slice in years 1โ€“3 via the hackathon launch and creator-led distribution.

Indicative figures for hackathon pitches โ€” refine with your own research before raising.

See also

Adjacent entries.