Inspired by these questions,
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?