{{Method Infobox
|name=Lewis
|image=
|proposer=John Lewis (Shiv3r)
|year= Jan 2017
|steps= 5
|moves= 130-145
|variants = Stadler, [[Kenneth's Big Cubes Method]]
|algs= 0-12(and CLL)
|purpose=
* [[Speedsolving]]
}}
The Lewis method is a 4x4 speedsolving method that utililzes Direct Solving and [[Roux Method]]-based steps to create a method that is both efficient(movecount comparable to Hoya or Meyer) and pretty lookahead friendly. Some critics say it is a variant of the Stadler Method, even though Lewis is an improvement over both Stadler and [[Kenneth's Big Cubes Method]], and only resembles Stadler in the first few steps.
==Steps==
Lewis Method is broken up into 5 steps:
#Solve 2 opposite centers(L and R centers)
#Solve a 1x3x4 block around the left center(Similar to Roux first block on 4x4)
#solve a 1x3x4 block around the right center(Similar to Roux second block)
#CMLL(John Lewis also will try to solve some of step 5a before he executes CMLL)
#Step 5, aka Last 28 pieces. Broken up into 3 steps:
**Step 5a: solve the BD Block. This solves the B and D centers and the BD edge.
***there are Several ways to do this. the original way is to solve the D center(which sometimes done before CMLL), then the B center, then use the 2 free faces to solve the BD edge and insert it.
**Step 5B: solve Last 2 centers. This step is entirely made of the moves <l,r,U> and is simple to look ahead to while finishing the BD block.
**Step 5C: solve the Last 5 edges with commutators(10 wing pieces). This step is usually abbreviated to L5E.
== Background==

As the story goes, the Lewis Method was invented in early January 2017 by John Lewis(who goes by the username Shiv3r) while playing around with [[Kenneth's Big Cubes Method]] one evening. He decided the first step in KBCM, columns, is not efficient or fast. By doing 2 opposite centers, then First block and Second block like in Stadler. He then experimented with solving centers, then solving the D layer with commutators, then ELL afterwards. Because it was a long night and he was bored, he decided to do a few timed solves. To his surprise, within the first 5 or so solves he missed his PB by 2 seconds(He was using the [[Meyer method]] at the time and averaged sub-2). After realizing his method had some potential, John experimented more, optimizing step 5 for both lookahead and efficiency and at the same time. In the process of developing the method, he created a new substep, L5E.

About a month later, Austin Moore revealed in a livestream on twitch that he had played around with the Lewis method. He then proceeded to get several fast solves with it. He has not switched from K4, but he is a very fast Lewis solver still.
==Solving L5E==
There are a few ways to solve L5E, and the suggested way has changed more than once.
Currently The fastest and most lookahead-efficient way is 4-look L5E, in which you use both DF pieces as "buffers" and then directly solve 2 pieces at a time, which takes 4 looks on average. Often you will get only 2 edges messed up at the end of L5E. in this case, you can use one of ~12 L2E cases(of which half are mirrors, so about 6 algs)(You May need to conjugate the algorithm). [https://www.youtube.com/watch?v=HSpEyihE2sI&t=124s Here is a tutorial for 4 look L5E]
==Pros==
*solves pieces directly.
*movecount is comparable to [[Meyer method]], [[Hoya method]], and Straight Redux
*L5E is very fluid and lookahead friendly.
==Cons==
*No 3x3 stage
*Commutators are hard to understand at first
*average movecount is slightly higher than [[Yau method]]
==External links==
*[https://www.speedsolving.com/wiki/index.php/User:Kenneth:Kenneth%27s_Big_Cubes_Method#ELL_3: L2E algorithms]
*[https://www.youtube.com/watch?v=T6YHZltlM_w&t=79s Lewis Method Video Tutorial]
*[https://youtu.be/HSpEyihE2sI 4 Look L5E tutorial]
*[https://www.youtube.com/channel/UCEuVjmTxYfw16pARBLpQaEA John's Youtube channel, which has solves and tutorials for the Method]

[[Category:4x4x4 methods]] [[Category:Big Cube methods]]

Shiv3r:

{{Method Infobox
|name=ECE method
|image=[[File:ECE-finalstep.png]]
|proposers= Crafto22, Joseph Briggs(Shadowslice e)
|year= 2015
|anames= [[SSC (Shadowslice Snow Columns)]]
|variants= Original variant, L6e variant, Broken variant,permute-last variant, EZD variant, NoEO variant
|steps= 5 major though lots of flexibility. Depends on variant
|algs=around 50 max, 10 min.
|moves= ~45 [[STM]]
|purpose=
* [[Speedsolving]], [[FMC]]
}}

==Method Overview==
Variations of this method has been independently invented by at least 3 people, but the person that has developed it the most, Crafto22, Is the official inventor of this method. The method is one of the most move-efficient method to ever have a sub-10 second solve(~45 STM, depending on the variant) This method is more move-efficient than roux, has less algorithms to learn than CFOP (full ECE has ~50 algorithms, full CFOP at least 78), and takes less time to learn.

==The Steps==
*Solve 3 E-slice edges while orienting 3 corners on the D-layer(It doesn't matter if U and D corners are mixed; just that they are oriented).
*Insert the final E-slice edge while orienting the U-layer corners.
there are a few ways to do this:
**create a psuedo-F2L pair with the final e-slice edge and any corner and then either A) Insert it and then use [[OCLL]] algorithms to orient the U-layer corners, or B) Insert the pair using a F2LL-type algorithm set [[Winter Variation]], or [[SLS (Shadowslice Last Slot)]]
**Solve the final E-slice Edge without caring about orientation or the corner and then [http://cube.garron.us/MGLS/ CLS] algorithms(You only need to learn the I-category algorithms, totaling 14 algorithms(7 mirrors))
*Use modified Square-1 algorithms to solve all the corners
**Separate the corners into their respective layers
**permute all the corners
*Insert D-layer Edges while orienting the remaining edges
*EPLL
==Pros==
*Extremely low movecount(similar to Hawaiian Kociemba) but can still be fast
*Low algorithm count compared to more popular speedsolving methods
==See Also==

ECE method

2016-04-12T16:58:21Z

Shiv3r:

{{Method Infobox
|name=ECE method
|image=File:ECE-finalstep.png
|proposers= Crafto22, Joseph Briggs(Shadowslice e)
|year= 2015
|anames= ECE (proposed by crafto22 alternatively later)
|variants= Original variant, L6e variant, Broken variant,permute-last variant, EZD variant, NoEO variant
|steps= 5 major though lots of flexibility. Depends on variant
|algs=around 50 max, 10 min.
|moves= ~45 [[STM]]
|purpose=
* [[Speedsolving]], [[FMC]]
}}

==Method Overview==
Variations of this method has been independently invented by at least 3 people, but the person that has developed it the most, Crafto22, Is the official inventor of this method. The method is one of the most move-efficient method to ever have a sub-10 second solve(~45 STM, depending on the variant) This method is more move-efficient than roux, has less algorithms to learn than CFOP (full ECE has ~50 algorithms, full CFOP at least 78), and takes less time to learn.

==The Steps==
*Solve 3 E-slice edges while orienting 3 corners on the D-layer(It doesn't matter if U and D corners are mixed; just that they are oriented).
*Insert the final E-slice edge while orienting the U-layer corners.
there are a few ways to do this:
**create a psuedo-F2L pair with the final e-slice edge and any corner and then either A) Insert it and then use [[OCLL]] algorithms to orient the U-layer corners, or B) Insert the pair using a F2LL-type algorithm set [[Winter Variation]], or [[SLS (Shadowslice Last Slot)]]
**Solve the final E-slice Edge without caring about orientation or the corner and then [http://cube.garron.us/MGLS/ CLS] algorithms(You only need to learn the I-category algorithms, totaling 14 algorithms(7 mirrors))
*Use modified Square-1 algorithms to solve all the corners
**Separate the corners into their respective layers
**permute all the corners
*Insert D-layer Edges while orienting the remaining edges
*EPLL
==Pros==
*Extremely low movecount(similar to Hawaiian Kociemba) but can still be fast
*Low algorithm count compared to more popular speedsolving methods
==See Also==