To solving times, To advance, you’ll have to learn procedures that efficiently shortcut your way. You’ll have to do one of these (I) the Condition 1 algorithm double, (ii) the Condition two algorithm double, (iii) the Condition 1 algorithm, after which the Condition two algorithm, or (iv) the Condition two algorithm, after which the Condition 1 algorithm. On Lars’ website, the algorithm has been implemented from a somewhat different angle both two corners being merged are front-top-right along with front-top-left. However, it’s exactly the identical specific algorithm. Play it to switch some two LL corners. Position it to your LL corner swap that is adjoining that is final and then execute the LL corner swap approach that is adjacent.