Which combinations of story choices has no tester ever had at the finale?
A finale that reacts to many earlier choices has far too many combinations to test all of them. This entry checks the much smaller set of pairs of choices, lists the pairs no tester has met, and ignores pairs the story makes impossible.
Why this works
Most mistakes appear when just two facts meet, not when dozens do. Covering every pair of facts at least once catches nearly all of them with a handful of testers, where trying every full combination would never end.
When not to use it
It misses faults that need three facts together, and it wastes effort on a finale that barely reacts to earlier choices. If a few facts truly interact in a tricky way, test those particular combinations in full by hand.
In the full entry
- What to build, step by step
- Starting values and the reason for each
- 3 common mistakes and the fix
- 32 lines of example code with 4 checks that pass
- How your AI shows you that it works
Say this to your AI
Use the Spielerando entry "Which combinations of story choices has no tester ever had at the finale?" (read_entry story-flag-combinations-never-tested) in my game. Build it step by step, and show me how you checked that it works.Or skip this and connect the MCP: your AI then finds all of this by itself.Connect the MCP