The Rubik’s cube is one of the most popular and challenging puzzles in the world. It has 6 sides, each with 9 stickers of one of 6 colors: white, yellow, blue, green, orange, and red. The goal is to restore the cube to its original state, where each side has only one color.

You might think that solving the cube is very hard, but it’s actually not. You don’t need to memorize hundreds of moves or algorithms. You just need to follow a simple method that divides the cube into layers and solves each layer one by one. This method is called the beginner’s method, and it only requires 6 steps:

  1. Notation: Learn the basic terms and symbols used to describe the cube and its movements.

  2. Making the Cross: Solve the white cross on the bottom layer, matching the colors of the edge pieces with the center pieces.

  3. First Layer Corner: Solve the white corners on the bottom layer, completing the first face of the cube.

  4. Second Layer: Solve the four edge pieces on the middle layer, aligning them with the center pieces of the same color.

  5. Yellow Cross: Solve the yellow cross on the top layer, using a simple algorithm to flip the edge pieces.

  6. Solve the Cube: Solve the remaining pieces on the top layer, using two more algorithms to orient and permute the corner pieces.

In this blog, Each step in detail, with pictures and examples to help you understand. By the end of this blog, you will be able to solve the Rubik’s cube on your own, and impress your friends and family with your skills.

STEP 1 : Notation

Video Tutorial: A simple and easy guide to 3×3 notation

Before we start solving the cube, we need to learn some basic terms and symbols that will help us describe the cube and its movements. These are:

  • Face: A face is one of the six sides of the cube. Each face has a name based on its position: front (F), right ®, up (U), left (L), down (D), and back (B).
  • Piece: A piece is one of the 26 smaller cubes that make up the Rubik’s cube. There are three types of pieces: center, edge, and corner. A center piece has one sticker and stays in the same place. An edge piece has two stickers and can move along the edge between two faces. A corner piece has three stickers and can move along the corner between three faces.
  • Layer: A layer is a group of nine pieces that belong to the same face. For example, the bottom layer consists of the nine pieces on the down face.
  • Turn: A turn is a 90-degree rotation of a face or a layer. A turn is denoted by the name of the face or layer, followed by a symbol that indicates the direction of the rotation. A clockwise turn is denoted by no symbol, and an anticlockwise turn is denoted by an apostrophe (‘). For example, F means turn the front face clockwise, and U’ means turn the up face anticlockwise. A double turn is a 180-degree rotation, and is denoted by a 2. For example, R2 means turn the right face twice, either clockwise or anticlockwise.
  • Algorithm: An algorithm is a sequence of turns that achieves a certain result on the cube. An algorithm is written as a series of symbols separated by spaces. For example, F R U R’ U’ F’ is an algorithm that flips the edge piece on the front face.

Rubiks cube notation

 

STEP 2 : Making the Cross

Video Tutorial: Making the Cross | Solve Rubik's

The white cross is the first step of the beginner’s method. The goal is to place four white edge pieces on the bottom layer, such that the colors of the edge pieces match the colors of the center pieces on the adjacent faces. For example, the white and blue edge piece should be on the edge between the white and blue faces.

To make the white cross, we need to find the white edge pieces on the cube and move them to the bottom layer. There are four possible cases, depending on where the white edge piece is and how it is oriented. Here are the four cases and the algorithms to solve them:

  • Case 1: The white edge piece is on the top layer, and the white sticker is facing up. In this case, we just need to turn the top layer until the white edge piece is above the face that matches its color, and then turn that face twice to bring the piece down. For example, if the white and green edge piece is on the top layer, and the white sticker is facing up, we can turn the top layer until the piece is above the green face, and then turn the green face twice to bring the piece down. The algorithm is: U F2.
  • Case 2: The white edge piece is on the top layer, and the white sticker is facing the side. In this case, we need to turn the top layer until the white edge piece is above the white face, and then turn the side face that matches the color of the piece to bring it down. For example, if the white and red edge piece is on the top layer, and the white sticker is facing the side, we can turn the top layer until the piece is above the white face, and then turn the right face to bring it down. The algorithm is: U R.
  • Case 3: The white edge piece is on the middle layer, and the white sticker is facing the side. In this case, we need to move the piece to the top layer, and then solve it as case 1 or case 2. To move the piece to the top layer, we need to turn the side face that matches the color of the piece, and then turn the top layer to move the piece away. For example, if the white and orange edge piece is on the middle layer, and the white sticker is facing the side, we can turn the left face to move the piece to the top layer, and then turn the top layer to move the piece away. The algorithm is: L U.
  • Case 4: The white edge piece is on the bottom layer, and the white sticker is facing down. In this case, we need to flip the piece so that the white sticker is facing the side, and then solve it as case 3. To flip the piece, we need to turn the bottom layer until the piece is under the face that matches its color, and then turn that face twice to move the piece to the top layer. For example, if the white and blue edge piece is on the bottom layer, and the white sticker is facing down, we can turn the bottom layer until the piece is under the blue face, and then turn the blue face twice to move the piece to the top layer. The algorithm is: D F2

Making the Cross

 

STEP 3: First Layer


The first layer is the second step of the beginner’s method. The goal is to place four white corner pieces on the bottom layer, such that they match the colors of the edge pieces and the center pieces on the adjacent faces. For example, the white, blue, and red corner piece should be on the corner between the white, blue, and red faces.

To solve the first layer, we need to find the white corner pieces on the cube and move them to the bottom layer. There are three possible cases, depending on where the white corner piece is and how it is oriented. Here are the three cases and the algorithms to solve them:

  • Case 1: The white corner piece is on the top layer, and the white sticker is facing up. In this case, we just need to turn the top layer until the white corner piece is above the corner that matches its colors, and then apply a simple algorithm to bring the piece down. The algorithm is: R’ D’ R D. This algorithm moves the piece from the top layer to the bottom layer, without affecting the white cross.
  • Case 2: The white corner piece is on the top layer, and the white sticker is facing the side. In this case, we need to turn the top layer until the white corner piece is above the face that matches the color of the sticker, and then apply a simple algorithm to bring the piece down. The algorithm is: F’ U’ F U. This algorithm moves the piece from the top layer to the bottom layer, without affecting the white cross.
  • Case 3: The white corner piece is on the bottom layer, but in the wrong place or orientation. In this case, we need to move the piece to the top layer, and then solve it as case 1 or case 2. To move the piece to the top layer, we can use the same algorithm as case 1: R’ D’ R D. This algorithm moves the piece from the bottom layer to the top layer, without affecting the white cross.

 

STEP 4: Second Layer


The second layer is the third step of the beginner’s method. The goal is to place four edge pieces on the middle layer, such that they match the colors of the center pieces on the adjacent faces. For example, the blue and red edge piece should be on the edge between the blue and red faces.

To solve the second layer, we need to find the edge pieces that belong to the middle layer and move them from the top layer to the middle layer. There are two possible cases, depending on which side the edge piece needs to go. Here are the two cases and the algorithms to solve them:

  • Case 1: The edge piece needs to go to the right side. In this case, we need to turn the top layer until the edge piece is above the right face, and then apply a simple algorithm to move the piece to the right side. The algorithm is: U R U’ R’ U’ F’ U F. This algorithm moves the piece from the top layer to the right side of the middle layer, without affecting the first layer.
  • Case 2: The edge piece needs to go to the left side. In this case, we need to turn the top layer until the edge piece is above the left face, and then apply a simple algorithm to move the piece to the left side. The algorithm is: U’ L’ U L U F U’ F’. This algorithm moves the piece from the top layer to the left side of the middle layer, without affecting the first layer.

STEP 5: Yellow cross


The third layer cross is the fourth step of the beginner’s method. The goal is to place four yellow edge pieces on the top layer, such that they form a yellow cross. The colors of the edge pieces do not need to match the colors of the center pieces on the adjacent faces yet.

To solve the third layer cross, we need to apply a simple algorithm that flips the edge pieces on the top layer. The algorithm is: F R U R’ U’ F’. This algorithm flips the edge piece on the front face and the edge piece on the right face, without affecting the first and second layers.

Depending on the initial state of the top layer, we may need to apply this algorithm once, twice, or three times, to get the yellow cross. Here are the possible cases and the solutions:

  • Case 1: There is no yellow edge piece on the top layer. In this case, we can apply the algorithm from any position, and then repeat it from the same position, to get the yellow cross. The solution is: F R U R’ U’ F’ (x2).
  • Case 2: There is one yellow edge piece on the top layer, forming a yellow dot. In this case, we can apply the algorithm from any position, and then adjust the top layer to align the yellow edge piece with the front face, and then apply the algorithm again, to get the yellow cross. The solution is: F R U R’ U’ F’ U F R U R’ U’ F’.
  • Case 3: There are two yellow edge pieces on the top layer, forming a yellow L shape. In this case, we need to turn the top layer until the yellow L shape is in the front-right corner, and then apply the algorithm once, to get the yellow cross. The solution is: U F R U R’ U’ F’.
  • Case 4: There are two yellow edge pieces on the top layer, forming a yellow line. In this case, we need to turn the top layer until the yellow line is horizontal, and then apply the algorithm once, to get the yellow cross. The solution is: F R U R’ U’ F’.
  • Case 5: There are four yellow edge pieces on the top layer, forming a yellow cross. In this case, we do not need to apply the algorithm, and we can move on to the next step.

STEP 6: Solve the Cube


The final step of the beginner’s method is to solve the cube by placing the remaining pieces on the top layer in their correct positions and orientations. This step consists of two sub-steps: orienting the corners and permuting the corners.

Sub-step 1: Orienting the Corners

The goal of this sub-step is to rotate the corner pieces on the top layer, such that they have the yellow sticker facing up. The colors of the corner pieces do not need to match the colors of the center pieces on the adjacent faces yet.

To orient the corners, we need to apply a simple algorithm that rotates the corner pieces on the top layer. The algorithm is: R’ D’ R D. This algorithm rotates the corner piece on the front-right corner clockwise, and the corner piece on the back-right corner anticlockwise, without affecting the first, second, and third layers.

Depending on the initial state of the top layer, we may need to apply this algorithm once, twice, three times, or four times, to orient the corners. Here are the possible cases and the solutions:

  • Case 1: There are no yellow corner pieces on the top layer. In this case, we can apply the algorithm from any position, and then repeat it from the same position, to get one yellow corner piece on the top layer. Then, we need to turn the top layer until the yellow corner piece is in the back-left corner, and then apply the algorithm again, to get two more yellow corner pieces on the top layer. Then, we need to turn the top layer until the last yellow corner piece is in the front-right corner, and then apply the algorithm again, to orient all the corners. The solution is: R’ D’ R D (x2) U’ R’ D’ R D U R’ D’ R D.
  • Case 2: There is one yellow corner piece on the top layer, and the yellow sticker is facing the side. In this case, we need to turn the top layer until the yellow corner piece is in the front-right corner, and then apply the algorithm once, to get two more yellow corner pieces on the top layer. Then, we need to turn the top layer until the last yellow corner piece is in the front-right corner, and then apply the algorithm again, to orient all the corners. The solution is: U R’ D’ R D U R’ D’ R D.
  • Case 3: There is one yellow corner piece on the top layer, and the yellow sticker is facing up. In this case, we need to turn the top layer until the yellow corner piece is in the back-left corner, and then apply the algorithm once, to get two more yellow corner pieces on the top layer. Then, we need to turn the top layer until the last yellow corner piece is in the front-right corner, and then apply the algorithm again, to orient all the corners. The solution is: U’ R’ D’ R D U R’ D’ R D.
  • Case 4: There are two yellow corner pieces on the top layer, and they are adjacent to each other. In this case, we need to turn the top layer until the two yellow corner pieces are in the back-left and back-right corners, and then apply the algorithm once, to orient all the corners. The solution is: U’ R’ D’ R D.
  • Case 5: There are two yellow corner pieces on the top layer, and they are opposite to each other. In this case, we need to turn the top layer until one of the yellow corner pieces is in the front-right corner, and then apply the algorithm twice, to orient all the corners. The solution is: R’ D’ R D (x2).
  • Case 6: There are three yellow corner pieces on the top layer, and they are adjacent to each other. In this case, we need to turn the top layer until the non-yellow corner piece is in the front-right corner, and then apply the algorithm once, to orient all the corners. The solution is: R’ D’ R D.
  • Case 7: There are four yellow corner pieces on the top layer, and they are all oriented correctly. In this case, we do not need to apply the algorithm, and we can move on to the next sub-step.

 

Sub-step 2: Permuting the Corners

The goal of this sub-step is to swap the corner pieces on the top layer, such that they match the colors of the center pieces on the adjacent faces. The colors of the edge pieces do not need to match the colors of the center pieces on the adjacent faces yet.

To permute the corners, we need to apply a simple algorithm that swaps the corner pieces on the top layer. The algorithm is: U R U’ L’ U

Our Speed Cube Trainer : JS ARUN

JS Arun is an Indian speed cuber, and the candidate at World Cube Association who specialises in 3*3 Rubik’s cube with the best time of 8 seconds. And also all the WCA puzzles.

He has recently set his Harvard World Records, Guinness world records, Asia book of records, Indian book of records, World icon awards, National book of records and The “BHARAT VIBHUSHAN AWARDS” ( Highest civilisation awards of Indian book of records) and many other National and international awards 

Arun is a cube expert, Trainer and a coach has been into cubing industry for the past 7 years and he taught more than 1000+ students

 

April 04, 2026

Leave a comment

Please note: comments must be approved before they are published.