0
$\begingroup$

Inspired by these questions,

Is it possible to scramble a Rubik's cube such that no two squares of the same color are touching?

and

Rubik's cube with no squares of same color nearby

I've been trying to scramble my cube so that it has a maximum of two squares of the same colour per side, regardless of whether those squares touch or not.

Any thoughts on what the smallest number of moves that achieves this from the solved state could be?

How about achieving this state from an already scrambled cube? Whenever I try this, it always takes longer than I expect and I haven't found any good way to attack this problem. Any thoughts on this? Is it in fact trivial? Am I missing something? How would you go about attacking this problem?

Improve this question
$\endgroup$
1
  • 1
    $\begingroup$ The second page you linked (puzzling.stackexchange.com/questions/69904/…) has an interesting solution. Florian F's solution shows a "super-scramble" that satisfies your constraint of at most 2 squares of the same color per side. Though, it has some more constraints and surely isn't optimal for this purpose. Still, it could be a good place to start. $\endgroup$
    – rhkoulen
    Mar 18 at 22:46

0

Reset to default