mark49152
Premium Member
Generally, negative recognition is slower than positive recognition. So if you see an F-perm and positively recognise that as an F-perm in 0.3 seconds then great, job done, no need to think further, just execute your F-perm alg. But recognising by process of elimination that your PLL is a parity case takes longer - "I don't recognise that, could be a G-perm but that edge looks wrong, hang on, let me check the back, nope, that's definitely parity".Good point, I just do PLL parity if I don't see a PLL case.
Corner cases are never affected by parity though so recognising and executing an A- or V-perm (or whatever you prefer) can be done really quickly leaving you with a much easier to recognise EPLL case.
It is of course possible to positively recognise PLL parity just by looking at the edges, but for some reason I find this hard when the corners aren't solved, and besides, 2-look also has the advantage that you don't need to master as many LL algs for bigger cubes - most of my 3x3 PLLs I find much harder to finger trick on 4x4+. No more G-perms
Assuming you mean EO, there are two parity cases - either 1 or 3 edges misoriented. When one edge is misoriented, just do your regular parity alg to flip it. When three are misoriented, the "normal" approach would be to flip one so that you now have 2 or 4 edges oriented (or 0 if you really screw it upI don't quite understand your first step, would you care to elaborate?
However, with a simple 2-move setup, you can make your parity alg flip 3 edges instead, so that after parity you always have all edges oriented. Then you know you'll always get an OCLL case.
Edit:
Indeed, I know 1-2 of the Pi/H cases, but I only have so much memory capacityMark, you could also combine steps 2 and 3 with COLL, which is a useful alg set to learn. Just a suggestion![]()
Last edited: