Scribd Logo
Încărcați

Bine ați venit la Scribd!

  • PLL Parity Cases

    Încărcat de

    Kattya Enciso Quispe
    993 vizualizări2 pagini
    The document describes a set of algorithms for solving PLL parity cases that occur when permuting the corners or edges of a Rubik's Cube. It lists 22 different PLL parity algorithms organized into groups for edge-only cases, diagonal corner swap cases, and adjacent corner swap cases. The algorithms shown combine a PLL case with a PLL parity algorithm or vice versa, with some requiring an AUF adjustment between the two steps.

    Descriere originală:

    Pll Parity Cases

    Titlu original

    Pll Parity Cases

    Drepturi de autor

    © © All Rights Reserved

    Formate disponibile

    PDF, TXT sau citiți online pe Scribd

    Vi se pare util acest document?

    Este necorespunzător acest conținut?

    Raportați acest document
    The document describes a set of algorithms for solving PLL parity cases that occur when permuting the corners or edges of a Rubik's Cube. It lists 22 different PLL parity algorithms organized into groups for edge-only cases, diagonal corner swap cases, and adjacent corner swap cases. The algorithms shown combine a PLL case with a PLL parity algorithm or vice versa, with some requiring an AUF adjustment between the two steps.

    Drepturi de autor:

    © All Rights Reserved
    Descărcați ca PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    993 vizualizări2 pagini

    PLL Parity Cases

    Încărcat de

    Kattya Enciso Quispe
    The document describes a set of algorithms for solving PLL parity cases that occur when permuting the corners or edges of a Rubik's Cube. It lists 22 different PLL parity algorithms organized into groups for edge-only cases, diagonal corner swap cases, and adjacent corner swap cases. The algorithms shown combine a PLL case with a PLL parity algorithm or vice versa, with some requiring an AUF adjustment between the two steps.

    Drepturi de autor:

    © All Rights Reserved
    Descărcați ca PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    din 2

    PLL + Parity Cases

    Images sourced from C onrad Rider's VisualCube - http://cube.crider.co.uk/visualcube.php

    Algorithm Presentation Format

    For some of these cases, an AUF (Adjustment of U


    Face) will be required between the PLL Parity
    Algorithm and the PLL case.

    [Parity] refers to executing the below algorithm:


    • r2 U2 r2 Uw2 r2 Uw2 U2

    Algorithm here
    Alternative algorithm here

    Cases are shown in the following order:


    • Edge Only Cases [5]
    • Diagonal Corner Swap Cases [5]
    • Adjacent Corner Swap Cases [12]

    R U R' U' [Parity] Z Permutation + [Parity] Z Permutation + [Parity]


    [Parity]
    U R U' R' (any angle) (any angle)

    [Parity] + U Permutation
    (any angle)
    F (R U' R' U') (R U R' F')
    [Parity] + E Permutation [Parity] + Y Permutation
    [Parity] + Na Permutation [Parity] (R U R' U') (R' F R F')
    (any angle) V Permutation + [PLL Parity]
    (any angle)

    [Parity] + V Permutation
    V Permutation + [PLL Parity]

    T Permutation + [Parity] [Parity] + T Permutation [Parity] + Jb Permutation Jb Permutation + [Parity]

    [Parity] + Gd Permutation (R U R' U') (R' F R2 U' R')


    Jb Permutation + [Parity] y/y' [Parity] + Jb Permutation
    Ja Permutation + [Parity] [Parity] U' (R U R' F')

    [Parity] + A Permutation [Parity] + A Permutation


    [Parity] + Rb Permutation [Parity] + Ra Permutation
    (any angle) (any angle)

    S-ar putea să vă placă și