The letter 'i' means inverse, or counter-clockwise twists. During the following steps, specific faces require a sequence of twists (or quarter turns). Each face of the cube is assigned a letter. With this final step, the Rubik’s cube is finally solved.Using this method, even a certified idiot can solve a Rubik's Cube in seven basic steps. After arranging all the corner pieces, just move the yellow facing layer 1-2 times if needed to completely solve your cube. Step 8: In the final step keep yellow as the front face and start from any corner apply the algorithm U R’ U’ R until the corner arranges correctly, then rotate the top layer to bring another disarranged corner on the top right side and repeat U R’ U’ R algorithm again to arrange it, and so on. If none of the corner pieces are in the right place, you can hold the cube in any orientation with the unmatched pieces on top and apply the algorithm U R U’ L’ U R’ U’ L.Īfter applying this algorithm 1-3 times the cube will look like. Step 7: Now to match all the corner pieces on the top layer, first see the corner which is already being matched and keep it as the front face and towards the right. Step 6: Now match any one edge of the top layer with the centerpiece in the middle layer, and then apply the algorithm F R U R’ U’ F’ until all the edges are matched. Step 5: Make the yellow cross on the top layer by applying the simple algorithm F R U R’ U’ F’ 1-3 times as shown below.

Case2: If the other part color matches with the centerpiece at the left side, then apply the algorithm U’ L’ U’ L U F U F’.Īfter applying this to all other pieces, the cube will look like this.Case 1: If the other part color matches with the centerpiece at the right side, then apply the algorithm U R U R’ U’ F’ U’ F.First, match the color of the top layer edge with its center layer and observe the other part of the piece i.e top facing color. Step 4: Make the second layer by matching all four edges at the lateral faces. Then apply the algorithm R U R’ U’ and repeat the same algorithm till the bottom corner piece is set at its correct position as shown belowĪfter setting all the corners, the cube will look like this. Step 3: Set corners of the bottom layer by first matching the correct corner matching its desired color. Step 2: Match colors of all four centerpieces of the lateral face with the edges of the bottom layer one by one and sending the matched pairs in opposite directions and then bringing them again to make a cross of white.Īfter matching all the layers, the cube will look like this. Step 1: First choose a centerpiece of any color (say white) and then make a white cross by bringing all the four edge pieces adjacent to the white center.

The easy solution to solve a Rubik’s cube is to follow the approach to first solve the bottom layer, then the middle layer, and then finally the top layer.īelow are the steps to solve a Rubik’s cube.

F’: Rotate the front layer anti-clockwise.

U’: Rotate the top layer anti-clockwise.

L’: Rotate the left layer anti-clockwise.

R’: Rotate the right layer anti-clockwise.

Set in C++ Standard Template Library (STL)Ī 3x3x3 Rubik’s cube is made by joining 21 pieces: 1 principle piece with three axles, 8 corner pieces (corner solid shapes) with three tones, and 12 edge pieces (edge 3D squares) with two tones.Ĭenterpieces are always at their original position only.

Write a program to print all permutations of a given string.

Sort a nearly sorted (or K sorted) array.

k largest(or smallest) elements in an array.

K’th Smallest/Largest Element using STL.

K’th Smallest/Largest Element in Unsorted Array | Set 3 (Worst Case Linear Time).

K’th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time).

K’th Smallest/Largest Element in Unsorted Array | Set 1.

Reverse an Array in groups of given size.

Minimum Number of Platforms Required for a Railway/Bus Station.

K Centers Problem | Set 1 (Greedy Approximate Algorithm).

Greedy Algorithm to find Minimum number of Coins.

Find minimum number of coins that make a given value.

Bell Numbers (Number of ways to Partition a Set).

Minimum number of jumps to reach end | Set 2 (O(n) solution).

Minimize the maximum difference between the heights.

ISRO CS Syllabus for Scientist/Engineer Exam.

ISRO CS Original Papers and Official Keys.

GATE CS Original Papers and Official Keys.

Rubiks cube flip corners