So i not too long ago obtained a Rubik’s Cube and learnt how you can remedy it, and as anybody has I attempted shuffling it to the ‘hardest’ attainable state to resolve from, for which my standards was: not one of the similar colored sides should be touching linearly (I now know the toughest state is the ‘superflip’ however this query remains to be fascinating).

Yes, I do know of 1 state which is completed by: R2 L2 U2 D2 F2 B2. This creates a pleasant sample.

But my query is what number of different attainable permutations are attainable the place not one of the similar colored squares is touching? (And is that this comparatively excessive or low in comparison with the full variety of permutations?)