Inspired by Rubik's cube

Logic Level 3

While solving a \(3 \times 3\) Rubik's cube , Trevor has only \(n\) \(2 \text{-colored}\) (edge) cubies in the wrong position. All other cubies are correctly oriented and positioned. What is the minimum possible value of \(n\)?

Inspiration.
×

Problem Loading...

Note Loading...

Set Loading...