--- In [email protected], "Stefan Pochmann" <[EMAIL PROTECTED]> wrote: > > For a while I wanted to know how many sune variant applications I need > to solve OLL. > > Let's say standard sune is (R U R' U R U2 R'). You can invert it, you > can mirror it, and you can do an M' setup move which simply turns the > first R into r and the last R' into r'. So you have 8 sune variants of > 7 moves each. Besides this large number of easy variants, I also like > the sune for being a real simple algorithm (for beginners and for > hands :-). > > So I finally wrote a program and got this result: > > 1 case needs 0 sunes. > 6 cases need 1 sunes. > 42 cases need 2 sunes. > 9 cases need 3 sunes. > Average number of sunes needed: 2.01724 > > Next idea would be to find out how many sunes are needed (max/avg) to > solve the whole LL after corners have been permuted (because sunes > don't change the relative corner permutation). > > Cheers! > Stefan >
Interesting. Yes, very simple sequences like the Sune, can be powerful. Mixing and optimizing 2 simple sequences give elegant solutions to complex last-layer cases, often QTM-optimal (that's why I often said I would choose this approach if I wanted to become a ZB-boy). Lars Petrus computed solutions for all last-layer cases with oriented edges, based on 2 simple sequences. He may have the answer to your question. Gilles. ------------------------ Yahoo! Groups Sponsor --------------------~--> Get fast access to your favorite Yahoo! Groups. Make Yahoo! your home page http://us.click.yahoo.com/dpRU5A/wUILAA/yQLSAA/MXMplB/TM --------------------------------------------------------------------~-> Yahoo! Groups Links <*> To visit your group on the web, go to: http://groups.yahoo.com/group/speedsolvingrubikscube/ <*> To unsubscribe from this group, send an email to: [EMAIL PROTECTED] <*> Your use of Yahoo! Groups is subject to: http://docs.yahoo.com/info/terms/
