qqwref
Legend
- Joined
- Dec 18, 2007
- Messages
- 7,834
- Location
- a <script> tag near you
- WCA ID
- 2006GOTT01
- YouTube
- Visit Channel
For the curious, my current method is to use only corner presses to make all the groups of three non-corners in the smallest triangles either all black or all white. Then the second step is to solve everything without corner presses, and apply parity if necessary. I usually start from the top and work my way down.
You could try to predict the parity by counting the number of white corners plus the number of corner presses your plan would involve to solve the first step. If you typically start from the top, and typically avoid pressing the topmost corner, your parity fix would be to press the top corner at the very start. It'd be tough, though, since you'd have to essentially lookahead the entire first step.
EDIT: Hey, I managed to predict parity a couple times in a row (on level 3 which is almost certainly the maximum this is possible for). It wasn't always within 15 seconds, though, and I mispredicted it a few times after that. Just saying, it is definitely doable.
You could try to predict the parity by counting the number of white corners plus the number of corner presses your plan would involve to solve the first step. If you typically start from the top, and typically avoid pressing the topmost corner, your parity fix would be to press the top corner at the very start. It'd be tough, though, since you'd have to essentially lookahead the entire first step.
EDIT: Hey, I managed to predict parity a couple times in a row (on level 3 which is almost certainly the maximum this is possible for). It wasn't always within 15 seconds, though, and I mispredicted it a few times after that. Just saying, it is definitely doable.
Last edited: