Sue Doenim
Member
- Joined
- Nov 9, 2016
- Messages
- 448
The thing about this is that the hard part of PCS is detecting the parity. Fixing the parity is the easy part. If you understand parity, changing it to solved is the easy part. PCS isn't a set of algorithms; usually to change the parity, you just need to add in one move.Just an idea I think I'm gonna try and wanted throw out into the forums:
For square-1, parity cubeshape is a thing now. The problem with it is it requires a ton of practice and knowing 2 algs for each cubeshape case. Instead, why not detect parity during cubeshape and then use parity CP to eliminate parity. From what I understand CP Parity's big downfall is recognition time so if you know you need to use a parity cp alg from the beginning then it should be pretty close in speed to normal CP. This also gives you the benefit of a backup parity detection step. If you messed up detecting parity in inspection you can still take a second to recognize parity in CP step before executing an alg.
I do think that parity cubeshape is probably going to ultimately be better but I think this may be a good alternative/intermediate step to learning PCS as it practices the detection and only requires learning 8 algs to begin with.
Any thoughts/opinions on this?