Difference between revisions of "Pyraminx algorithms"

From Speedsolving.com Wiki
Line 13: Line 13:
 
*Case 3; ... R' L R L U L U' ... "[[U-PLL]]".
 
*Case 3; ... R' L R L U L U' ... "[[U-PLL]]".
 
*Case 4; ... L R' L' R' U' R' U ... Mirror U.
 
*Case 4; ... L R' L' R' U' R' U ... Mirror U.
*Case 5; ... R' L R L' U L' U' L ... Flips two edges, same as Niklas (y') mirror Niklas).
+
*Case 5; ... R' L R L' U L' U' L ... Flips two edges, (same as Niklas (y') mirror Niklas).
  
 
=== Last edge on first tip: ===
 
=== Last edge on first tip: ===

Revision as of 21:19, 28 August 2008

A list of algorithms for Pyraminx.

Note, when describing specific edges orientation the faces are needed, normally the notation refers to the tips. In these descriptions a face is oppisite to a tip, the L face is opposite to the R tip, R face opposites L tip, D face U tip and F face B tip. This makes the six edges RF (or FR depending on orientation), LF, DF, RD, LD and RL. The first three makes the first or last layer edges, the last three the first or last tip edges depending on method used.

See also:

Edges of Last Layer (ELL)

The last layer edges are the three ones sourrounded 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; ... R' L R L' ... "Niklas".
  • Case 2; ... L R' L' R ... Mirror "Niklas" (or inverse).
  • Case 3; ... R' L R L U L U' ... "U-PLL".
  • Case 4; ... L R' L' R' U' R' U ... Mirror U.
  • Case 5; ... R' L R L' U L' U' L ... Flips two edges, (same as Niklas (y') mirror Niklas).

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 somwhere 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 makeing it 5 uniqe cases. The occurance is 1:8 (1 skip in 8 solves). All algorithms in this group preserves LD and RL edges and all four centres, 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 5).
  • 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.