E35 is a method that solves the last eight edges of the U and D layers, first three D layer edges are done and then the last five ones. Always preserving all corners and E-slice edges. In most cases the first part also solves the centres.
E35 is not a compleate brute force method, it uses a combination of intuition and algorithms, an advanced user even include ELL in the method to save turns in some cases but most times you end in EPLL or 5 edge permutation. It is much as Roux last step but here orientation is done after all centres are solved to make recognition easier/faster so the M-permut used last in Roux is not really useful here (you solve centres and BD before orient instead of RU/LU after).
- E3 part First pair up RD and LD edges, then place them together with R and L centres or simply do one at the time, the first one as a pair with the centre and the second using AUF M' U/U'/U2 M, last palce BD + B centre as a pair.
- E5 part this part has got two main sub-parts, first orient the edges using the Roux M' U M style (5 cases, newer the worst 6 edge case of Roux). If possible also place FD during orientation, else do it after using M' U2 M and end in EPLL. You can also first orient and then permute all five edges in one go (EP5).
E35 may be used in CF if the E-slice is solved after the corners or in any method that solves columns first, like doing all pairs first and then CMLL (or CMSLL). The E5 part is a stand alone method that can be used for Roux if the BD edge and centres are solved before edge orientation.
Intermediate system for E5
This intuitive style is not all intuitive because you need to know EPLL. First orient all unorientd edges, then place the FD edge to it's correct position and end the solve in EPLL. For that you basicly need this:
- P = M' U2 M
- O = M' U M
- O' = M' U' M
- O2 = P
From that plus some U turns you can solve any case, example: O U P = (M' U M) U (M' U2 M). O solves orientation U P places FD edge and then the EPLL solves permutation for the last four edges, all now in LL (if it did not skip, it is a 1:12 chance).
The algorithms for some cases can be shorter if you also add this to the system:
- F() = F2 ( moves ) [u] F2
The U turn can be any U, U' U2 or no U turn depending on how U moves inside the parentesis of the "function". F(U P) makes the usual 7 turn U-PLL = F2 (U M' U2 M) U F2. F(O) is a nice way to solve orientation and place FD in one go if it is in the middle of three unoriented edges in LL, just AUF as you where about to do only O.
The intuitive style lets you find and understand the algorithms you need to orient the 5 cases that are possible for the orientation part but another approach is to learn the algorithms instead of finding them.
- O U2 O ... (M' U M) U2 (M' U M) ... orients UL and UB
- O U' O ... (M' U M) U' (M' U M) ... orients UF and UB
- P U2 O ... (M' U2 M) U2 (M' U M) ... orients UR, UF, UL and UB
- O U O ... (M' U M) U (M' U M) ... orients FD and UB
- O ... (M' U M) ... orients FD, UR, UF and UL
Sometimes you will solve FD permutation while doing this. If you learn the position of the edge before the orientation that leads to a solve you can for some situations also learn to use the mirror algorithm instead when the FD edge is on the opposite side from where you normally solve it, the easiest example is to use O' (M' U' M) instead of O (M' U M). In the cases where you cannot solve FD permutation while orienting you use AUF + P to solve it, it is at the most 4 turns, then EPLL.
Orientations with FD permutation:
In many cases you can solve FD permutation wile orienting in the same number of turns as you do only orientation. For the rest of the cases it is a bad idéa to learn algorithms because they would most times end in the same turns as do anyway to solve FD after orientation or if not the length of the algorithm is of the same length as the 2-step or at least almost. But there are a number of good cases, here is the list: