M2/3-Style parity

[Alex Gold]

I'm trying to learn M2 for edges and 3-style for corners. I'm not sure what to do if I have parity ?

 

[Spencer131]

I'm trying to learn M2 for edges and 3-style for corners. I'm not sure what to do if I have parity ?

A parity algorithm should swap 2 edges and 2 corners (2e2c). There are many options, and lots of PLLs can be used for 2e2c swap

Set up the corners and edges such that they can be solved with one of the 2e2c algorithms you know

 

[GloopyGum]

There's two options:

1) Memo corners and edges like normal. After executing edges, do this alg: M2 U M U2 M U M' U2 M' U2. This will swap the UR and UB edges.
For corners, stick a "B" onto the last letter of your memo. If your corner memo was OR LK ND H, then execute the last letter pair as HB. After executing corners, do a Ja perm and you're done.

2) (The better way) Memo corners first; if there's parity, then memo the UR (B in speffz) and UF (C in speffz) edges as swapped. Pretend that the UR edge is the UF edge, and the UF edge is the UR edge. If you do that correctly, then there will always be an even number of edges letters. Then execute the right parity alg depending on what your last corner letter is.

Parity algs: https://docs.google.com/spreadsheet...zoFNHJ0GidKrUm8NC0OzNcRdk/edit#gid=1451363679
Alternatively, you can stick a B onto the last letter of your memo and execute a Jb perm.

Also I would recommend learning orozco for corners first; it's basically a subset of 20 3style comms, but execution takes twice as long.

 

[Alex Gold]

There's two options:

1) Memo corners and edges like normal. After executing edges, do this alg: M2 U M U2 M U M' U2 M' U2. This will swap the UR and UB edges.
For corners, stick a "B" onto the last letter of your memo. If your corner memo was OR LK ND H, then execute the last letter pair as HB. After executing corners, do a Ja perm and you're done.

2) (The better way) Memo corners first; if there's parity, then memo the UR (B in speffz) and UF (C in speffz) edges as swapped. Pretend that the UR edge is the UF edge, and the UF edge is the UR edge. If you do that correctly, then there will always be an even number of edges letters. Then execute the right parity alg depending on what your last corner letter is.

Parity algs: https://docs.google.com/spreadsheet...zoFNHJ0GidKrUm8NC0OzNcRdk/edit#gid=1451363679
Alternatively, you can stick a B onto the last letter of your memo and execute a Jb perm.

Also I would recommend learning orozco for corners first; it's basically a subset of 20 3style comms, but execution takes twice as long.

For both the methods I should do CEEC right ?

 

[GloopyGum]

Yes

 

[Alex Gold]

Yes

I could also swap the A and B edges as swapped during memo and then execute the Ja perm right ?

 

[Alex Gold]

There's two options:

1) Memo corners and edges like normal. After executing edges, do this alg: M2 U M U2 M U M' U2 M' U2. This will swap the UR and UB edges.
For corners, stick a "B" onto the last letter of your memo. If your corner memo was OR LK ND H, then execute the last letter pair as HB. After executing corners, do a Ja perm and you're done.

2) (The better way) Memo corners first; if there's parity, then memo the UR (B in speffz) and UF (C in speffz) edges as swapped. Pretend that the UR edge is the UF edge, and the UF edge is the UR edge. If you do that correctly, then there will always be an even number of edges letters. Then execute the right parity alg depending on what your last corner letter is.

Parity algs: https://docs.google.com/spreadsheet...zoFNHJ0GidKrUm8NC0OzNcRdk/edit#gid=1451363679
Alternatively, you can stick a B onto the last letter of your memo and execute a Jb perm.

Also I would recommend learning orozco for corners first; it's basically a subset of 20 3style comms, but execution takes twice as long.

What do I do if I cycle break to B or C ?

 

[GloopyGum]

What do I do if I cycle break to B or C ?

Trace as normal; pretend that the green sticker on the white-green edge is red, and the red sticker on the white-red edge is green. If you cycle break to B, the cycle ends when you hit the white-green edge (if you have parity).

You could swap A and B in memo, but it's faster execution wise to swap B and C

 

[abunickabhi]

Trace as normal; pretend that the green sticker on the white-green edge is red, and the red sticker on the white-red edge is green. If you cycle break to B, the cycle ends when you hit the white-green edge (if you have parity).

You could swap A and B in memo, but it's faster execution wise to swap B and C

Yes correct