Difference between revisions of "Åxeon"
From Speedsolving.com Wiki
AxelExaCuber (talk | contribs) m |
AxelExaCuber (talk | contribs) m |
||
Line 21: | Line 21: | ||
#RUrM-gen F2L-1 | #RUrM-gen F2L-1 | ||
#[[1LLSLL]] | #[[1LLSLL]] | ||
+ | |||
+ | ==About LSLL== | ||
+ | This method solves Last Slot and Last layer together using only 1-look. The substep is commonly known as 1LLSLL. The first system of solving LS+LL in 1-look is proposed by LexCubing with his method [[My World]] using 1LLSLL system and the system was inspired by 1LLL and M-CELL. 1LLL solves LL in 1-look using 3915 algorithms and M-CELL solves LS and LL in 2-look and realised that both method uses algorithms to solve each LSLL directly. 1LLSLL solves LSLL in 1-look. | ||
==Pros== | ==Pros== |
Revision as of 12:51, 13 September 2022
|
Åxeon is a experimental method proposed independently by Zehtroide (aka Zeht). The idea is to make the method suitable for Speedsolving, One-handed and also Fewest Moves. However the method contains highly algorithms during last step.
Contents
Steps Overview
About LSLL
This method solves Last Slot and Last layer together using only 1-look. The substep is commonly known as 1LLSLL. The first system of solving LS+LL in 1-look is proposed by LexCubing with his method My World using 1LLSLL system and the system was inspired by 1LLL and M-CELL. 1LLL solves LL in 1-look using 3915 algorithms and M-CELL solves LS and LL in 2-look and realised that both method uses algorithms to solve each LSLL directly. 1LLSLL solves LSLL in 1-look.
Pros
- Low Movecount
- No rotations required
Cons
- EO may be difficult to understand
- Highly algorithms count