Before testers arrive: can every scene be reached, and can every ending be won?

Stories with keys, trust and other remembered facts hide dead ends that only appear when you play a very particular way. This entry walks the story map for you and names the rooms nobody can enter, the doors that need a thing nobody can get, and the loops without exit.

Why this works

Dead ends hide behind remembered facts, so a plain map of scenes always looks fine. Asking what could possibly be known by now, and growing that step by step, finds rooms and endings that the rules make impossible without spending a single tester.

When not to use it

It gives a best case, not a promise: two facts that rule each other out can still slip through, and things the player can lose are not taken into account. Treat what it flags as certain and everything else as a reason to play it.

In the full entry

• What to build, step by step
• Starting values and the reason for each
• 4 common mistakes and the fix
• 50 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 "Before testers arrive: can every scene be reached, and can every ending be won?" (read_entry story-graph-lint-with-flags) 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