*** Developer of this puzzle can’t solve it because it is too difficult. Please solves this puzzle!! ***
- Rule -
Four Tiles around tap point are rotated by counter-clockwise. At initial state, the tiles is shuffled. In order to solve, you must rearrange tiles like blue tiles form a line on upper two rows within specified fewest moves.
- Logical ground -
First, program constructs graph by regarding all tiles arrange as node and all player moves as edge. Second, calculate fewest moves by solve shortest path problem on the graph transposed.
So, player can solve all stages theoretically.