Find scenes whose entry condition can never be true

A scene is linked on the map and guarded by a condition that looks reasonable, yet no player ever sees it, because the earlier choices that satisfy the condition rule each other out. This entry shows the search that finds it and what the AI reports.

Why this works

Each condition can be reachable alone and still never be true together, because earlier choices shut each other out. Whether a scene can be seen depends on the combination a player carries when arriving, so you must follow the combinations, not just the map.

When not to use it

Skip it when a scene is meant to be a rare secret or only for a second playthrough, or when you track values that count up over many steps. List the secrets as intended, and turn counting values into a few named levels first.

In the full entry

• What to build, step by step
• Starting values and the reason for each
• 3 common mistakes and the fix
• A diagram of every state
• 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 "Find scenes whose entry condition can never be true" (read_entry scene-that-no-playthrough-can-enter) 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