1x1x1 Rubik’s cubes do exist, but since they have no moving parts and therefore cannot be scrambled, they are really just novelty joke objects. What I’m imagining here I don’t believe exists in the real world, and I’m not sure what the mechanism would be, but with my cube it is possible to swap the colours of two adjacent faces. What I’ve shown below is the solved state, which is that red and orange are opposite, blue and green are opposite, white and yellow are opposite, and red-white-blue run clockwise around their shared vertex. Any whole-cube rotation of this is still the solved state, but a mirror reflection is not. Obviously to solve this cube is trivially easy, so the question is, what is the minimum number of moves (adjacent colour swaps) by which it is ALWAYS possible to solve the cube, no matter what the starting scramble?