#### dudefaceguy

##### Member

- Joined
- Feb 17, 2019

- Messages
- 57

Eve is one of Lars Petrus's algorithms demonstrated here: https://lar5.com/cube/yE.htmlCool, I couldn’t say I’ve seen and idea like this! Flowcharts are very useful btw! I kinda want to play around with it, but I might need help on what ‘Eve’ is or how to do a pure twist commutator... :/

I perform it as: R U2 L' U R' U' L R U2 R'

I actually find it very intuitive and fun to perform.

I don't know if there are other corner twist commutators, but the one I use is, for example, U[R D R' D' R D R']. I'm sure you know a shorter algorithm for this case.

Petrus uses double Sune for two twisted corners, which is the same number of moves as a corner twist commutator. I'm faster with the commutator though.

I like using Petrus corners for Roux because it's a two-look method that uses only 3 algorithms, all of which are very intuituve and easy to execute. I actually discovered Niklas on my own while using Heise, and used it for months before realizing that it was a famous algorithm.

I don't see much point in orienting first and then permuting for Roux corners - this seems like a carryover from CFOP. If you're solving the whole last layer, orient/permute makes sense, but permute/orient can solve corners in two looks with fewer cases to recognize. You can also force second-look skips pretty often if you understand what the algorithms are doing. Since I never learned beginners method or CFOP, Petrus corners seem like a good choice for Roux.

Fun fact: Lars Petrus's Allan algorithm, which is used to solve edges after corners are solved, is just a conjugate of the 4-move commutator that is usually used to solve the last 3 edges in Roux.