BLE Algorithms (Brooks’ Last Edge)
Developed by Feliks Zemdegs & Anthony Brooks
                                                        and Andy Klise
                   Images sourced from Conrad Rider's VisualCube - http://cube.crider.co.uk/visualcube.php
                                 Algorithm Presentation Format
                                                                  Round brackets are used to segment algorithms to
                                                                  assist memorisation and group move triggers.
                                                                  It is recommended to learn the algorithms in the
                                                                  order presented.
            Suggested algorithm here                              The legend to the left indicates shading and text
                                                                  colour patterns used in this sheet to signify
                                                                  similarities across algorithms.
                   Insert to OLL
     Break up F2L pair // Solve F2L pair
                                    H Cases + Corners Oriented Case
U' (R U' R' U') (R U R' U R U                                     U (R U' R' U') (R U2' R' U R U
                                (R U' R' U') (R U' R' U R U R')
             R')                                                                R')
                                                       Sune Cases
(R U R' U2') (R U R' U2' R U'     U' (F' R U R') (U' R' F R)        U' (F' R U R') (U' R' F R)     U (R U' R' U) (R U R' U2' R U
             R')                           -> OLL                            -> OLL                             R')
                                                Anti-Sune Cases
                                U' (F' R U R') (U' R' F R)   U' (R U' R' U2) (R U' R' U' R U   U' (R U R' U2') (R U' R' U2 R
U' (F' R U R2') U' R' F R U R
                                         -> OLL                            R')                             U' R')
                                                        L Cases
U (R U' R' U) y' (R' U R U R'    (R' F' R U) (R U' R' F)                                       U2 (R U2' R' U') y' (R' U2 R U'
                                                                U' (F' R U R') (U' R' F R)
           U2 R)                         -> OLL                                                           R' U' R)
                                                        T Cases
                                 (R' F' R U) (R U' R' F)        U' (F' R U R') (U' R' F R)       U' (F' R U R') (U' R' F R)
   (R' F' R U) (R U' R' F)
                                         -> OLL                          -> OLL                           -> OLL
                                                       U Cases
  U' (F' R U R') (U' R' F R)    U' (F' R U R') (U' R' F R)   U' (R' D' R U') (R' D R U) (R U   U (R U' R') (U' R' D' R) (U R'
           -> OLL                        -> OLL                            R')                              D R)
                                                       Pi Cases
  U' (F' R U R') (U' R' F R)     (R' F' R U) (R U' R' F)     U2 (R U2' R' U) (R U' R' U2 R     U2 (R U R' U2') (R U2' R' U2
           -> OLL                        -> OLL                         U' R')                          R U' R')