Some of the descriptions here uses a extended notation, see Pyraminx notation for an explanation of the system.
Edges of Last Layer: (ELL)
The last layer edges are the three ones surrounded by the three tips R, L and U (the F face), that makes the edges RF, DF and LF. There are 6 cases in this group, of these one is solved. The occurance is 1:12 (1 skip in 12 solves) so some of the cases are more than once. All algorithms in this group preserves all but the last three edges.
- Case 1; ... solved.
- Case 2; ... R' L R L' ... Sledgehammer, cycles (FD)->LF->(RF)->(FD)
- Case 3; ... L R' L' R ... Hedgeslammer, cycles (FD)->RF->(LF)->(FD)
- Case 4; ... R' L R L2' U L U' ... U-PLL, cycles FD->FL->FR->FD
- Case 5; ... L R' L' R' U' R' U ... Mirror U, cycles FD->FR->FL->FD
- Case 6; ... L R' L' R U' R U R' ... 2-edge flip, (FR) (FL).
Last edge on first tip:
The last edge on the first tip is normally the second last step, done before ELL. The edge is in this case RD. In the description the case is where the RD edge is initially, in position or somewhere in the last layer (F face), R side first face-letter and D side second. There are 8 cases in this group, of these one is solved (notated RD just as the edge) and three are mirrors making it 5 unique cases. The occurance is 1:8 (1 skip in 8 solves). All algorithms in this group preserves LD and RD edges and all four centers, the last layer edges are ignored.
- Case 1 RD; ... solved.
- Case 2 DR; ... L R L' R B' R B ... or inverse (you can also use ELL 6).
- Case 3 RF; ... U B U B' U ... mirror of FD.
- Case 4 FR; ... U' R' U R ... mirror of DF.
- Case 5 FL; ... R L R' L' ... mirror of LF.
- Case 6 LF; ... R' U' R U ... mirror of FL.
- Case 7 DF; ... L R L' R' ... mirror of FR.
- Case 8 FD; ... L' B' L' B L' ... mirror of RF.
Last Layer algorithms:
These algorithms are for the last layer when you are using a layer by layer method. These algs affect the U layer. Note that for cases 4 and 5, you must be sure you are holding the pyraminx correctly before performing the algs, as the cases can be a bit difficult to recognize. If you adjust the U layer, you should see that one of the edges matches up to the sides. You want to position this edge in the back when performing the algorithm. With practice, you can recognize these 2 cases without having to turn the U layer. An alternative recognition method is as follows: Make sure the U layer's corner piece is oriented correctly, and then you should have 2 edges that are "half-oriented", and one that is not oriented at all. Then you just hold the pyraminx so the non-oriented edge is in the back.
- Case 1; ... R' L R L' U L' U' L ... flip 2 edges on F
- Case 2; ... R' U' R U' R' U' R ... cycle edges clockwise
- Case 3; ... R' U R U R' U R ... cycle edges counter-clockwise
- Case 4; ... L U R U' R' L' ... flip 2 edges and cycle clockwise.
- Case 5; ... R' U' L' U L R ... flip 2 edges and cycle counter-clockwise.