Schrodinger's Puzzle

The map is a hexagon grid. At the start, each tile is in “superstate”: it’s in all 6 possible states at the same time, it hasn’t picked a single one yet.

By entering the tile from a certain side, you permanently determine the state it’s in from now on.

That’s it. A very tight puzzle about finding the right path through the grid to turn all cells into the right states.

The main questions/problems are:

  • Theming
  • Easy explanation and escalating mechanics
  • Keeping it visually clear: showing six possible states inside the tile, and which side they belong to, might be hard => if I can find some alternative to this idea that’s more visually appealing, that would be great.