Recently I devised a Rubik's cube method which calls for the memorization of only one move sequence (and does not require commutators or even conjugates). My goal was to devise a beginner's method which was easy to learn, without concern for efficiency. I searched around the forums a bit, and I couldn't find anyone who had done a similar thing.
The move sequence itself is:
F2 R' U' F R F2 R F R2 F' R2 U R
It is 13 moves long, generated by cube explorer. I designed it in such a way so that:
- It swaps the FD corner pair
- It swaps the FD and FR edges
- When performed twice, it flips the FD and FR edges
- When performed four times, it orients the FU corner pair
Using only this algorithm, it is possible to execute each of the steps below to solve the cube:
1. Position corners.
2. Position edges.
3. Orient edges.
4. Orient corners.
The "trickiest" part for a beginner would probably be step 2. To cycle the FL, FD, and FR edges, the solver must first perform the algorithm normally, then mirrored from right to left. (To cycle in the opposite direction, the mirror may be performed first.) Other than that, it is pretty straight forward.
Am I the first to think of such a method?
PS: Note how I put "Algorithm" in quotes in the thread title, since an algorithm TECHNICALLY can be any sequence of moves... ;U It should really read "One Move Sequence Method", but for colloquial reasons I have decided to use "Algorithm" instead.
The move sequence itself is:
F2 R' U' F R F2 R F R2 F' R2 U R
It is 13 moves long, generated by cube explorer. I designed it in such a way so that:
- It swaps the FD corner pair
- It swaps the FD and FR edges
- When performed twice, it flips the FD and FR edges
- When performed four times, it orients the FU corner pair
Using only this algorithm, it is possible to execute each of the steps below to solve the cube:
1. Position corners.
2. Position edges.
3. Orient edges.
4. Orient corners.
The "trickiest" part for a beginner would probably be step 2. To cycle the FL, FD, and FR edges, the solver must first perform the algorithm normally, then mirrored from right to left. (To cycle in the opposite direction, the mirror may be performed first.) Other than that, it is pretty straight forward.
Am I the first to think of such a method?
PS: Note how I put "Algorithm" in quotes in the thread title, since an algorithm TECHNICALLY can be any sequence of moves... ;U It should really read "One Move Sequence Method", but for colloquial reasons I have decided to use "Algorithm" instead.