Intuitive megaminx last layer method (fish & chips variant)
Channel: hurfcharacterlimit
Date: 2017-11-29

Actual method I use. It's worse than 4LLL, but as an intuitive method, it's considerably better than the usual beginner's methods.

Steps:
1. EO
2. Edge-corner-edge block (~1.5 looks)
3. L3E (1 look)
4. L4C (~1.5 looks)

Forcing L3C when solving L3E:
Pair that needs to move to the opposite side: Sune or Antisune
Pair that needs to move to an adjacent side: J perms, Y perms
Twisted corner: double Sune, double Antisune, Bruno
Solved corner: U perms (R U R' U R' U' R2 U' R' U R' U R + inverse)

Some L4C cases:
A perm: [R' U': [F' L' F, R]] + inverse
Not A perm: ([BR' R': [U L U', R']] + inverse
"X" perm: L' triple Sune L
E perm: x' R U' R' D R U R' D' R U R' D R U' R' D'
Not E perm: R U R' U R' U' R F' R U R' U' R' F R2 U' R2' U R
Pure H: double Sune cancel into U perm + inverse

E-C-E block optimisation (wall of text below!):
In this video I mostly used Sune variants to match already-oriented corners to edges, but the worst case here is when none of the corners start out oriented and sometimes I use three Sunes (see 1:24). This is kind of bad and I need to figure out how to avoid it.

Of course, Sunes also affect corner orientation, which we can use to our advantage. Sometimes there'll be an angle where the first R/R' move of a Sune will orient a corner and match it to an edge, and then we just have to join this pair to another edge to form a block.

Sometimes there's a "block" where the corner is correctly oriented, but the edges adjacent to it need to be swapped. This would use three Sunes with the basic method shown in this video, but R' U' R' U' R2 U' R' U R' U R U R also works (and is obviously faster). It's not a good case, but it's very easy to recognise and exploit when there aren't any pairs.

Sometimes there are multiple pairs lying around, and there are various algs to deal with those. One basic shape is where there're two pairs of the same orientation sharing one colour touching each other (looks like a J perm). This can be dealt with with R U2 R' U R U2 R' (and the mirror) or with the T perm alg; these permute edges differently, so you can choose between these to force a skip of the L3E step *and* ensure you have L3C instead of L4C.

Another shape is where there is almost an ECECE block, except the middle edge is missing. By using R2 U2 R2' U R2 U2 R2' or the mirror, the missing edge can be inserted to again skip L3E and ensure L3C.

Half of the time, there will be (at least) two pairs of adjacent edges that are correctly permuted relative to each other (see 2:47). (The other half of the time, there won't be any correctly permuted pair, but there will be at least two pairs of adjacent edges that are swapped relative to each other.) Usually you can insert the missing corner with an 8-move commutator, which should be faster than doing two Sunes, but the problem I have with this is that I find it difficult to recognise whether there is a pair of correctly permuted edges at all.

Original method proposal: https://www.speedsolving.com/forum/threads/the-new-method-substep-concept-idea-thread.40975/page-166#post-1230171
efattah's method (which this is inspired by): https://www.speedsolving.com/forum/threads/unique-1983-megaminx-method.61792/