And you said you only needed the number.
И пока в кармане пачка милкиуэйев - значит все не так уж плохо на сегодняшний день
New here? I'm Roha — want a quick tour?
I wrote 17 or 18. Specifically.
The cop simply hates Mortulus and doesn't want him to participate in the [Gameplay] quiz.
You can create a graph where each vertex corresponds to a specific arrangement of the tiles. :) There will be a total of 6*5! = 720 vertices. Connect the vertices with edges representing possible transitions from one state of the field to another, and calculate the shortest paths from the state shown in the picture to all possible states where there are 4 tiles above 5 in the right row. :D The shortest one will be the answer.
You've become quite the expert, sir. However, I'd be happy to watch. :D