Basket

From Speedsolving.com Wiki
Basket method
Basket.png
Information about the method
Proposer(s): Allen Milazzo
Proposed: 2022
Alt Names: CMFL (Cross, Middle Layer, First 2 Layers, Last Layer
Variants: none
No. Steps: 3 substeps
No. Algs: 5
Avg Moves: unknown
Purpose(s):

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.

Overview

  1. Solve the cross Whitecross.png (This is the bottom of the cube)
  2. Solve Middle Layer Basket.png
  3. Solve F2L F2L.png
  4. Solve last layer

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.png

Speedsolving Logo tiny.gif 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

Basket-F2L-32.png

Speedsolving Logo tiny.gif F2L (R U R' U')(R U R' U')(R U R')


F2L 33

Basket-F2L-33.png

Speedsolving Logo tiny.gif F2L (U' R U' R') U2 (R U' R')


F2L 34

Basket-F2L-34.png

Speedsolving Logo tiny.gif 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