ABCDEFGH
1
This document contains the steps for an iterative EO process for L7E. It works just like LSE EO. Each EO case has a short algorithm. Use this algorithm then see what the next EO case is. Do this until EO is solved. The final EO state that everything leads to is the "arrow" state as it is called in LSE. In L7E they are called "transformed arrows". The algorithms for the transformed arrows are provided in two forms. A default alg and optional algs when all corners are perfectly aligned. These optional algs can put the corners into a transformed state as in the 42 method.

An * after a move means either a clockwise or counter-clockwise move will lead to the next case. Double turns aren't included in the *. Sometimes the * won't be provided for cases. This is because there could be a list of several possible endings with different post AUFs depending on the pre AUF. Algorithms are provided four the four possible AUFs for each case. This is so that you can either use an algorithm from a specific angle or do a U/U'/U2 to use an algorithm from one of the other AUFs.

Alternate sequences are provided for some cases. Using these alternates, just as in LSE EO, will be better in cases where you want to influence edges.

Example are included. Do them in reverse to see the EO case. The setups are provided in two forms. First in an iterative representation such as M' U M' > R > M U M > U' R'. The final U' R' isn't necessary. EO is already solved before this. These final moves only place the D layer corner back into the D layer for example purposes. It is best during a solve to solve edges before re-placing the D layer corner. Below the iterative form of the setup example is provided the full example in non-iterative form and including any move cancellations just as would be performed in a real solve.

A great thing about this L7E EO method is that you can often cancel out 1-3 moves. These cancellations come from the R and r moves that are sometimes involved. So by the end of an EO sequence it is essentially as if there were no moves added by adjusting the R layer to position a misoriented edge.

Future plans for this document:
- Add a tab for DRS Misoriented.
- Add charts that show visually the iterative process using the simplest algorithms for each case.
- Possibly some way to list all possible sequences for each EO case. Just as in LSE, there are several ways beyond just the ones provided to change an EO case into the next one.
- Other EO options using more R and r may be availalbe. Those will be added as they are found.
- Incorporate R and r moves into FRE/BRE/DRS oriented cases for influencing. So during LSE EO but when there is any oriented edge at FRE/BRE/DRS. This may be best for advanced use or not be something very commonly used.
- Add S move options to the LSE tab for even more versatility when DRS is the empty slot. This is another case of either advanced or really rare use.
- More tricks that take advantage of going into and out of the transformed corner state. Such as the optional transformed arrows algs.
- Misoriented centers tricks will help reduce movecount even further. Having a list of the good ones would be useful.

If you have any suggestions, contact me. My username everywhere is Athefre.