| EG method
|
|
| Information about the method
|
| Proposer(s):
|
Erik Akkersdijk
Gunnar Krig
|
| Proposed:
|
2006
|
| Alt Names:
|
none
|
| Variants:
|
CLL
|
| No. Steps:
|
2
|
| No. Algs:
|
120
|
| Avg Moves:
|
12.35
|
| Purpose(s):
|
|
|
The EG method (Erik-Gunnar) only has two steps: solve one face, and then finish the entire cube in one algorithm. Without reflections, it requires 120 non-PBL algorithms. There are 3 bottom layer cases that each require the same amount of algorithms as CLL. Those that know CLL already know 1/3rd of EG, the EG 2 cases. The other two groups of cases have a Y permutation on bottom EG 0, and a T permutation on bottom EG 1. Some cubers have only learnt CLL, and the T permutation on bottom case: you can cancel the last moves of making a face with 'R2 F2 R2' if you see that you will have the Y permutation on bottom case, giving you a normal CLL algorithm. For this reason, there is no internet published list of the Y permutation on bottom case.
Another method that has been used for EG 0 is to inverse solve LL using normal CLL, say you got EG 0 and CxLL H D, then you can use the CLL for CxLL H U that will "solve" LL to diagonal permut and then add the permutation for PBL 0+0 in the end. In some cases, like this, the alg ends in R2 so the only extra turn you need to add is the F2, like this; orginal CLL R2 U2 R U2 R2 makes R2 U2 R U2 F2 R2 to solve the inverse CLL and 0+0 PBL.
External Links
