So i not too long ago received a Rubik’s Dice and learnt the way to resolve it, and as anybody has I attempted shuffling it to the ‘hardest’ attainable state to unravel from, for which my standards was: not one of the identical colored sides should be touching linearly (I now know the toughest state is the ‘superflip’ however this query continues to be attention-grabbing).
Sure, I do know of 1 state which is completed by: R2 L2 U2 D2 F2 B2. This creates a pleasant sample.
However my query is what number of different attainable permutations are attainable the place not one of the identical colored squares is touching? (And is that this comparatively excessive or low in comparison with the whole variety of permutations?)
