Check that a combine-two-things puzzle can be solved and list the shortest route

In a puzzle where you combine two things into a third, one forgotten recipe leaves the last item out of reach, and nobody notices until a player writes in. This entry finds every item the player can reach from the start, names the ones they never can, and lists the combinations needed for any goal in order.

Why this works

When ingredients are never used up, finding things can only ever add to what you hold, never take away. So repeating the same sweep until nothing new appears must end, and whatever was never found truly cannot be made. Each item keeps the way it was first found, which gives a short route.

When not to use it

It does not fit puzzles where ingredients are used up or limited, because then the order of choices matters and a dead end is possible even when every item is reachable in theory. Use a check that tries whole sequences of moves instead.

In the full entry

• What to build, step by step
• Starting values and the reason for each
• 3 common mistakes and the fix
• 45 lines of example code with 5 checks that pass
• How your AI shows you that it works

Say this to your AI

Use the Spielerando entry "Check that a combine-two-things puzzle can be solved and list the shortest route" (read_entry puzzle-combine-route-to-target) 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