OLL for Fridrich Method.
The Beginner Fridrich Method is a simple version of Fridrich Method.
Cross[]
This step consisted of building a cross on one side, by inserting edge-pieces between the center of the starting side and another center, so that the colors of the corner match with the colors of the centers. This is done intuitively and by solving pieces one by one.
F2L[]
In the beginner version of the Fridrich Method this step is split into two parts: solving corners and solving edges.
At first the corners are solved one by one intuitively.
The Edges can be solved intuitively or with two algorithms. This algorithm moves an edge piece from the top-front to the left-front position:
U' L' U L U F U' F'
This algorithm moves an edge piece from the top-front to the right-front position:
U R U' R' U' F' U F
OLL[]
At first the edges are oriented using the following algorithm :
F R U R' U' F'
When the edges are not oriented, there can be three different patterns on the top side: the dot, the line and the r-shape.
The last mentioned Algorithm transforms a dot or an r-shape into a line and a line into a cross.
For the orientation of the corners the Sune (R U R' U R U2 R') is used.
Depending on the pattern on the last layer, the Sune is executed with different sides facing front, which results in one of the following patterns:
|
|
| In this case OLL is finished by executing a Sune | Here OLL is finished by executing an anti-Sune (L' U' L U' L' U2 L). It's also possible to apply Sune on this case to get the first case. |
PLL[]
To solve the corners a J Perm is used. This algorithm swap the two left-top corners.
The permutation of the edges is done with an A Perm. This algorithm permutes all last layer edges except the one in the Back.
In most cases the J Perm and the A Perm will be needed to be used multiple times in one solve, because they permute just a few last layer pieces at ones.