Prove that every level is solvable

The problem

A visually plausible maze can be impossible when collectibles block the intended route.

Practical procedure

Search states that include both player position and collected-item bitmask; require a path to the exit with all items.

Worked scenario

A path to the exit alone is insufficient if one required cell sits behind unreachable walls.

Acceptance check

Run the solver across every published level and replay each returned route in the movement engine.

Apply the method

Use the related interactive tool to try the concept on an inspectable example. Record the starting assumptions and expected result before changing settings, then compare what the tool actually does. Where the result differs, keep the release marked experimental and document the discrepancy.

Further reading: Relevant primary technical documentation. This guide is an educational procedure, not a substitute for independent usability or compliance review.