The basis of this method is again solving the upper cross, that is, placing the edges on the upper layer in correct positions. Instead of putting the corners themselves into the upper layer we employ a whole series of algorithms, which place the corner and its adjacent edge in their positions simultaneously. Most of these algorithms are relatively straightforward, and are either discussed in previous chapters or derived from them. Of course, it is possible to invent other algorihms, that can be quite useful and efficient. I will present a few examples here, you can figure out others after some time.
All situations can have their mirror-reversed doubles.
Then we use algorithms for mirror-reversal. Now we can proceed to solvin the last layer . This method differs quite a bit from those discussed previously. It does not progress from some layer to one adjacent to it. After this step we can freely rotate three mutually orthogonal unsolved layers and solve the cube gradually.