I'm trying to understand how to solve the Number Rotation Puzzle aka Twiddle.
I want to try to figure it out mostly myself but I need a little help. I've written a program to explore the puzzle, and from experimentation I suspect that it may not be possible to swap all pairs of tiles if we are constrained to rotating a 2x2 square within a 2x3 grid.
Is this correct please? If so, how could it be proved?
I'm thinking that there are only 16 possible permutations of positions based on 4 rotations for each 2x2 square, but I don't trust that as looked at in another way I think there are $6!$ potential permutations if all are reachable.
As you can probably see my grasp of both combinatorics and group theory is pretty weak - I am using this activity to try to improve my understanding of these topics.
Any help much appreciated.


Brute-force in Python:
(Basically, start with the set consisting of the single configuration $\begin{array}{c|c|c}1&2&3\\\hline4&5&6\end{array}$ and then apply the two available transforms until the set of all configurations stops growing).
The program outputs this:
The last 'False' means that $\begin{array}{c|c|c}1&2&3\\\hline6&5&4\end{array}$ cannot be obtained.