Benny

From Speedsolving.com Wiki
Revision as of 00:44, 11 February 2011 by ThePCKid (talk | contribs) (Created page with "{{Method Infobox |name=Benny |image=Benny.gif |proposers=Lars Petrus |year= |anames=B9 |variants= |steps=1 |algs=1 |moves=11 HTM |purpose=<sup></sup> * Speedsolving }...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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):


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:

This page is a DNF (incomplete).
Please help by expanding it.
There may be suggestions on its talk page.
Retrieved from "https://www.speedsolving.com/wiki/index.php?title=Benny&oldid=13731"