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 .

4 6 3 Such a situation is impossible. 2

1 solution

Ashwin Upadhyay
Sep 6, 2015

I am talking about this situation. Only these 2 pieces are reversed.

Please like and reshare the problem.

You'll have to prove that this is achievable and this is the minimum.

Agnishom Chattopadhyay - 5 years, 9 months ago

I have achieved this situation in the online cube game. I think this picture is enough for the proof & if anyone has any doubt, he can check it on online cube solver.

And, obviously n=2 is minimum as the whole cube solved with only one piece reversed is not possible.

I think you are a speedcuber?? You can try to achieve this position yourself.

Ashwin Upadhyay - 5 years, 9 months ago

R E R2 E2 R U R' E2 R2 E' R' U' If you know the notations there is an algorithm for it

Toni Sinervö - 5 years, 9 months ago

what does 'E' stand for??

Ashwin Upadhyay - 5 years, 9 months ago

@Ashwin Upadhyay – Equatorial slice moves. or slice moves along the y axis in the same direction as you would move D

Toni Sinervö - 5 years, 9 months ago

Inspired by Rubik's cube

Inspiration .

1 solution

0 pending reports