Basket
Basket is a method proposed by Allen Milazzo that solves the first two layers while also producing a greater chance to have a permutation skip. It is simple for beginners and fast for solving. In my opinion, it is slightly better than the Keyhole method because it requires fewer algorithms.
Contents
Overview
Algorithms
First, start by solving the bottom layer cross intuitively.
After the bottom layer cross, all four edges will be inserted into the E slice/middle layer using this algorithm:
ML
![]() |
Basket | (F R' F' R) |
You start, like in normal LBL from a cross, then you fill in all four edges of the first layer edges. From that point, you solve all of the corners using one of these three F2L algorithms:
F2L 32
![]() |
F2L | (R U R' U')(R U R' U')(R U R') |
F2L 33
![]() |
F2L | (U' R U' R') U2 (R U' R') |
F2L 34
![]() |
F2L | U (R U R') U2 (R U R') |
After solving F2L the chance of having a permutation skip is cut in half than its usual percentage. (Still not much but it's good)
See also
External links
- Get better at cross: https://www.youtube.com/watch?v=x93VB_v5ATM
- Cube image generator: https://tdecker91.github.io/puzzlegen-demo/