What is the minimum number of 1/4 turns of a solved 2x2 Rubik’s cube, such that no face will have two tiles of the same color?
(I do not have this puzzle’s solution.)
$\begingroup$
$\endgroup$
3
-
$\begingroup$ Is this an original puzzle? $\endgroup$– bobbleMay 6, 2021 at 3:05
-
$\begingroup$ @bobble It is, as far as I know. However, it does seem like the sort of thing someone else may have asked in the past, doesn’t it? $\endgroup$– GilbertMay 6, 2021 at 3:19
-
$\begingroup$ "As far as I know" is good enough for here :) The attribution requirement is meant to catch people who copy-paste from another source, or similar. $\endgroup$– bobbleMay 6, 2021 at 3:25
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
3
This is the shortest sequence I found:
It can be done in 5 moves.
Using standard notation, the moves are: RDRDF.
Here is a graphical rundown of the moves:
-
$\begingroup$ Do you have a proof for why less moves is impossible? $\endgroup$– bobbleMay 7, 2021 at 0:05
-
$\begingroup$ It’s been 24 hours, so I’m calling this solved (although I reserve the right to reconsider if someone comes along with a proof!). Great job! Also, thank you for the graphical rundown; I’m not fluent in the notation. $\endgroup$– GilbertMay 7, 2021 at 4:07
-
1$\begingroup$ I went through all the non-equivalent 4-length sequences as best I can, and none of them works. But I'm not 100% sure I got them all, and it's not a very elegant proof $\endgroup$– JoeMay 7, 2021 at 4:24