Niklas

R U' L' U R' U' L
Niklas
Niklasinfo.png
The Niklas is a common commutator applicable to many puzzles.
Information about the algorithm
Proposer(s): Lars Petrus
Alt Names:
Variants:
Number of moves: 8 HTM
Purpose(s):

The Niklas is a common commutator applicable to many puzzles. Lars Petrus coined the name as a last layer corner permutation algorithm for his method.

The Niklas may be written as R U' L' U R' U' L (U), which is the commutator [R, U' L' U], or [R, U': L']

The Niklas can also be performed in various ways using a combination of slice turns and face turns. This provides 8-move commutators that can cycle 3 pieces of any type. One form is particularly helpful for solving a few centers between two remaining faces at the center stage of the reduction method for cubes larger than 3x3x3.

Examples

(x') M' U' R U M U' R' U (x) ... does ELL, mirror and reflections makes four algs.

(x') r U' R U r' U' R' U (x) ... same for big cubes, change r to any slice and you have many combinations.

See also


External links