I think we all at one point or another have been messing around with the cube and been looking to scramble it in such a way that no single color is aligned with itself anywhere on the cube (without using algorithms). We turn and turn trying to break the pairs that continue to show up as we turn it, until eventually, in rare instances, we finally manage to scramble a cube in such a way as to separate all colors from their own kind. One example of this kind of scramble is known as the super flop. And I just achieved one recently, and it got me thinking...
What is the minimum number of moves required to achieve one? (Answered)
How many of these states exist on the 3x3?
This is either a mathematical problem or one that requires computer power to be thrown at it as well.
But what do you guys think? Can it be found?
Hey look, hundredth post.
What is the minimum number of moves required to achieve one? (Answered)
How many of these states exist on the 3x3?
This is either a mathematical problem or one that requires computer power to be thrown at it as well.
But what do you guys think? Can it be found?
Hey look, hundredth post.
Last edited:
