Top First
From Speedsolving.com Wiki
Top First is a group of Pyraminx methods which all solve the "top" (three edges around one center) first, followed by a usually algorithmic finish. They are often considered to be more intuitive than V First methods.
Although Top First and V First both used to be very popular, the latter is the most commonly used nowdays. However, many modern world-class solvers know methods from both and switch between them depending on the scramble.
Methods
Keyhole
Keyhole is a beginner's method which is often taught as an introduction to Top First.
- Step 1: Solve two edges around a center.
- Step 2: Use the extra edge slot, the "keyhole", to solve the centers of the last layer (the layer opposite that center).
- Step 3: Solve the edge that belongs in the keyhole. Algorithms can be found here.
- Step 4: Solves the edges of the last layer. Algorithms can be found here.
1-Flip
- Step 1: Solve two edges around a center, and put the third one in backwards.
- Step 2: Solve the centers and the flipped edge in one step.
- Step 3: Solve the edges of the last layer. Algorithms can be found here.
Oka
- Step 1: Solve one edge around a center, and insert another edge, the "Oka edge", oriented correctly, but in the wrong spot.
- Step 2: Use the extra edge slot, just like in Keyhole, to solve the centers.
- Step 3: Solve the incorrectly flipped edge and the keyhole in one step.
- Step 4: Solve the edges of the last layer. Algorithms can be found here.
WO
WO stands for Wedel-Odder, which are the names of the method's creators.
- Step 1: Solve all the three edges around a single center, forming a "top".
- Step 2: Use one algorithm to solve the centers while preserving the top.
- Step 3: Solve the edges of the last layer. Algorithms can be found here.
Nutella
- Step 1: Solve one edge around a center, and insert the two others in their opposite positions and orientation.
- Step 2: Solve the centers and those two edges with one algorithm.
- Step 3: Solve the edges of the last layer. Algorithms can be found here.
Bell
- Step 1: Solve one edge around a center, and form a "bar" (oriented edge in the wrong spot so it matches up with the center).
- Step 2: As in Keyhole, solve the centers using the free slot.
- Step 3: Perform a sledge, hedge or a different 3-cycle to solve the top.
- Step 4: Solve the edges of the last layer. Algorithms can be found here.
Notable users
- John Gaynor
- Drew Brads (recently with V First)
- Tymon Kolasiński (with V First)
See also
External links
- CubeRoot's Oka and Bell algorithms
- CubeRoot's 1-Flip, WO and Nutella algorithms
- Pyraminx Top First Helper, finds best starts with top-first methods
- 1-Flip, WO and Nutella algorithms
- Nutella algorithms
- YouTube: John Gaynor's Top First tutorial (all methods)
- Speedsolving.com: What happened to Top First?
- YouTube: Drew Brad's 1-Flip tutorial
- YouTube: Drew Brad's Oka tutorial
- YouTube: Drew Brad's WO and Nutella tutorial
- YouTube: Z3Cubing's Keyhole tutorial
- YouTube: Z3Cubing's Oka tutorial
- YouTube: Z3Cubing's 1-Flip tutorial
