Benny

Benny method Information about the method Proposer(s): Lars Petrus Proposed: Alt Names: B9 Variants: No. Steps: 1 No. Algs: 1 Avg Moves: 11 HTM Purpose(s): Speedsolving

R' U2 R2 U2 R2 U' R2 U' R2 U R

Benny is the name for a corner permutation algorithm by Lars Petrus. It looks like a Sune, but it is a bit different. It cycles four corners clockwise, swaps UL and UB, and orients the last layer. Benny is also a ZBLL algorithm.

See also

• Sune
• Niklas
• Bruno

This page is a DNF (incomplete). Please help by expanding it. There may be suggestions on its talk page.