![]() ]Ħ圆圆 (general big even cube representation) (inner orbit) (17q,16h)Ħ圆圆 (general big even cube representation) (outer orbit) (17q,16h)ħx7x7 (general big odd cube representation) (inner orbit) (19q,18h)ħx7x7 (general big odd cube representation) (outer orbit) (19q,18h) Z r' U 2L' u' r u 2L' f' 2L' f 2L2 u' r' 2U r z', which can be translated to the nx nx n like this: You would have to adapt some stuff to make it work for 5x5, but it's worth researching if you really don't want to just use reduction.Ĭlick to expand.Unless you are using my 16q/15h algorithm: (Yau is a reduction method)Īn example of a method that is not reduction and would have algs that are closer to what you're looking for is K4. You won't find many algorithms that affect both because the reduction method completes centers and edges before solving any of the 3x3 stage, and reduction methods are the only commonly used 5x5 method. The main reason algs for this stuff aren't documented is that almost any alg that affects edge pairing either completely ignores the 3x3 state, or only preserves F2L. If you want to solve this case, either do pure OLL parity on the orange/yellow tredge and then do an adjacent tredge pureflip of the yellow/orange and yellow/blue tredges, or do pure OLL parity on the orange/blue tredge and then do an adjacent midge pureflip on the yellow/orange and yellow/blue midges. If you really want to search for a bunch of useless algorithms, learn to use one of the computer programs that generates algorithms. No, nobody knows of one, because most people would rather actually use an efficient, complete method than doesn't require generating a bunch of miscellaneous, good for nothing algs anytime you run into a case you don't know how to solve. Yes, I'm sure an algorithm for this exists. I see two threads within the last week asking for algorithms, and I'm pretty sure you've made at least one more that a moderator merged to another thread. ![]() Please stop making a new thread for each question like this.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |