Fast Algs

[Richard]

Can some of you guys post some super fast algorithms that orient all possible situations for corners? It's alright if it affects the edge orientation/permutation in the U layer. I'm working on the Roux method, and have just been using some algs i know from the fridrich method to orient then permute the corners. I'm just wondering if there are some faster algorithms out there though cause some of mine are very slow. Also, what are some of your fastest algorithms to just swap two corners? Again, it doesn't matter if edge orientation changes, just as long as corner orientation does stay the same. Thanks in advance...

 

[pjk]

Hey Richie,
If no one replies here, send Mr. Roux an email, he'll probably know.

 

[AvGalen]

Maybe you like this one:
F (U R U' R') (U R U' R') (U R U' R') F'

of course you could also use

F (R U R' U') (R U R' U') (R U R' U') F'

which is faster for me.

 

[Kirjava]

Just pick the one with the shortest move count from each row. That's what I did when I started..

~Thom