Difference between revisions of "Benny"
From Speedsolving.com Wiki
(Gives a good enough explanation. Removed {{stub}}.) |
|||
| (4 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | {{ | + | {{Named Alg Infobox |
|name=Benny | |name=Benny | ||
|image=Benny.gif | |image=Benny.gif | ||
| Line 15: | Line 15: | ||
<center>''<big>R' U2 R2 U2 R2 U' R2 U' R2 U R</big>''</center> | <center>''<big>R' U2 R2 U2 R2 U' R2 U' R2 U R</big>''</center> | ||
| − | '''Benny''' is the name for a corner permutation algorithm by [[Lars Petrus]]. It looks like a [[Sune]], but it | + | '''Benny''' is the name for a corner permutation [[algorithm]] by [[Lars Petrus]]. |
| + | |||
| + | It looks like a [[Sune]], but it cycles four corners clockwise, swaps UL and UB, and orients the last layer. Benny is also a [[ZBLL]] algorithm. This can be used in many different methods, including [[CFOP]], [[ZZ]], [[Petrus]], [[ZB]], and more. | ||
==See also== | ==See also== | ||
Latest revision as of 19:19, 18 February 2018
| |||||||||||||||||||
Benny is the name for a corner permutation algorithm by Lars Petrus.
It looks like a Sune, but it cycles four corners clockwise, swaps UL and UB, and orients the last layer. Benny is also a ZBLL algorithm. This can be used in many different methods, including CFOP, ZZ, Petrus, ZB, and more.
