There is a simple solution. Because


Yes. Explicit Grid


Adding some findings to the answer by Display name. As already noted, Call the coin positions 1 2 3 4 5 6 7 8 9 and label the guard's moves with digits for the flipped coins, e.g. {147} and {2356}. The guard has sequences of moves which can: and sequences which can: By combining these sequences, the guard can solve any initial position where: Though it ...


I stumbled over this question by chance and it caught my interest. I am surprised nobody wrote a program to solve it yet. One question that isn't clear is what happens to a player who is standing on a tile when the tile stops to be solid. One would expect that the player falls and dies, but that isn't stated explicitly. Anyway, I wrote a program using its ...

Only top voted, non community-wiki answers of a minimum length are eligible