Set-up moves

[hait2]

usually the setup moves shouldn't be more than .. say .. 3?
and usually i only think of one way of doing it during the solve
i'd easily remember my last setup move, and while undoing it, recreate the state (if i forgot how the pieces moved) and see what would've been my first move. and figure it out that way. usually you just kinda feel it though.. not the moves themselves but how the pieces were affected by them. or at least that's how i do it

edit: give me some example and i could show you my thought process and my 'remembering' process

 

[Inusagi]

Thanks for trying to help!

Examples:
1. This one is a Parity.
Edges: UF and UR got to change.
Corners: URB ans DFL got to change.

2. 2 2-cycles for corners
First cycle: URB and UFL got to change
Second cycle: DBR and DFL got to change

I know it's not that hard to solve, but it's hard to know which algorithm to use after I have done the set-up. I just forget which pieces that much change, after I have done the set-up moves, because the pieces is a another place then before the set-up moves. I'll find it out rigth after, but the problem is that the time is till moving. Do you know about some rules that can help me on this?

 

[Subaruiz]

Why did you change the set up moves when you have parity ? Do a PLL , whith that , URB and URF change , and you have them in their good place , so use the same set up than you use when you haven't parity , and when you have solve the corners , execute PLL Z , and your cube will be solved.

 

[Simboubou]

( Hi Subaruiz ! )

Thanks for trying to help!

Examples:
1. This one is a Parity.
Edges: UF and UR got to change.
Corners: URB ans DFL got to change.

2. 2 2-cycles for corners
First cycle: URB and UFL got to change
Second cycle: DBR and DFL got to change

I know it's not that hard to solve, but it's hard to know which algorithm to use after I have done the set-up. I just forget which pieces that much change, after I have done the set-up moves, because the pieces is a another place then before the set-up moves. I'll find it out rigth after, but the problem is that the time is till moving. Do you know about some rules that can help me on this?

For case 1 do L2+PLL R+L2
For case 2 do : [LF']*3. This will switch UFL and DFL, and Two edges. Do this algorithm one more time on URB and DRB, and the cube will be solved.

I know a trick that may help you... which method do you use ?

 

[Inusagi]

Thanks. I use 3-cycle

 

[hait2]

Thanks for trying to help!

Examples:
1. This one is a Parity.
Edges: UF and UR got to change.
Corners: URB ans DFL got to change.

2. 2 2-cycles for corners
First cycle: URB and UFL got to change
Second cycle: DBR and DFL got to change

for the first one, UF UR URB are all on the same slice, so immediately i just think of how to bring up DFL up there to do a PLL, which would be L2 into R-perm, so if i managed to forget somehow, i just think back to "oh, i wanted to make this into a PLL, so i must've done L2" although only 1 setup move you really shouldn't forget

for the 2nd, i just think that Hperm U2 would solve it, so i set it up on the F face, with R2, rotate by x, and apply that. so... R2 x Hperm U2 x' R2

 

[Simboubou]

Thanks. I use 3-cycle

Ouch, this trick is not really designed for a pure 3-cycles...
Anyway, when you are a beginner, you can take more time to solve the parities : try to "move" these parities to a better location.

If you end up with a parity on the corners, "move" if to UFR and UBR. For instance, if at the end you have UFR and DBL switched, do L2 then a PLL A to do : UBR->UFR->ULF, and L2 again. Now, DBL is solve, and the two other are switched.
For edges, use the same method to "move" the parity to UR and UF.

So, eventually, you will end up with UFR-UBR and UF-UR to solve... this is just a PLL J !

Did you understand ( my english is not perfect .
The idea is to Solve the parity by creating a new one in a certain location. It is easier. ( And longer, but for the moment, it is enough... )

 

[hait2]

if you're going to use a trick like that.. there's a simpler one

use an algorithm that cycles an even number of edges and an even number of corners, thus getting rid of any parity. in fact, the simplest of such algorithms is U. It's a 4cycle of corners and a 4cycle of edges. if you discover you have parity, do an imaginary U turn and memorize everything as if you'd made the U turn. then start your solve by doing a U turn and voila, you don't even have parity in your solve.

i never bothered with this, but i can see how it would be helpful, and definitely more helpful than simply relocating the parity

edit: this is for corner-edge parity. if you have a corner-corner or edge-edge parity, well those are pretty easy to solve anyway so they aren't a big deal