Let's just say I have a generic scramble that scrambles only five corners. They can be permuted and / or oriented badly.
I know that the "sexy method" uses a "buffer" and repetition of the sexy move to solve them, but that uses a lot of moves. Probably you could just write some computer code to generate all the possible cases and all the possible solves, but there would be too many cases and too many algorithms to learn.
Is there any way other than that?
Thanks in advance
I know that the "sexy method" uses a "buffer" and repetition of the sexy move to solve them, but that uses a lot of moves. Probably you could just write some computer code to generate all the possible cases and all the possible solves, but there would be too many cases and too many algorithms to learn.
Is there any way other than that?
Thanks in advance
