[Help Thread] Square-1 Discussion

/3,0/1,-4/-2,0/2,2/-2,0/4,-1/0,-3/

Been looking into parity + cubeshape, found out that there's some interesting cases to be wary of. I first thought they were bad, but quickly realised they were useful. Does anyone currently inspect for parity on sq-1? I'll be starting to learn this soon hopefully.

But if you know full EP, then there really isn't any "parity", right?
 
/3,0/1,-4/-2,0/2,2/-2,0/4,-1/0,-3/

Been looking into parity + cubeshape, found out that there's some interesting cases to be wary of. I first thought they were bad, but quickly realised they were useful. Does anyone currently inspect for parity on sq-1? I'll be starting to learn this soon hopefully.

if you do look into that and get info i would love to read/watch what you come up with, please and thank you.
 
if you do look into that and get info i would love to read/watch what you come up with, please and thank you.
No problem, I've sorted most of it, but I've also left some of the trickier stuff until last.

no one inspects for parity because it is too difficult to track the pieces during cubeshape and then to count the cylces
Then don't trace the pieces through to cubeshape :p. For each shape, pick a solved position for each piece, it's arbitrary so pick an easy one, then trace using that reference. The real work in developing this method is using this to get to cubeshape with even parity.

Working on this seemed like it would be fun and different, it's the only reason I'm learning sq-1.
 
Can it be done? Theoretically, absolutely. Mike Hughey's BLD stuff has clearly proven that it's possible.

Can it be done in 15 seconds of inspection? I doubt it. At least not reliably. And even then, you have a ridiculously difficult inspection, possibly bad cubeshape algs (depending on the case, I guess... harder cases will be "easier" to affect parity without increasing length much, whereas easy cases will require you to backtrack before solving).

Even then... with Parity CP, parity just isn't that much of a solve-killer. A bad cubeshape hurts my solve as much as parity does.
 
How many permutation algs do I need to memorize at the very least to be able to solve a square-1?

/3,-3/0,3/-3,0/3,0/-3,0/ (switch bottom two front corners)

/6,6/ (switch layers)

-2,0/3,0/-1,-1/-2,1/ (switches back two edges on top and bottom)

/-3,0/0,3/0,-3/0,3/2,0/0,2/-2,0/4,0/0,-2/0,2/-1,4/0,-3/0,3 (parity)
 
I need an algorithm for Square-1. I knew it, just forgot it (didn't solve a Squere-1 in a year...)

It swaps UR-DR and DF-DB. If I recall well, I started with (1,0) or (0, -1) followed by a (3,0) or (-3,0), and also had a (1,1) or (-1,-1). Something like
(0,-1) / (3,0) / (1,1) / ...

and also had something like (-4,-1) in it. It was around 6 or 7 R2 turns.

Or can you tell me any algorithm, which swaps UR-DR and leaves everything on the top layer in place?
 
You'll love this site. I have a link to the ultimate site for Sq1 algs. It has algs for all optimal shape cases, as well as algs for ALL EP cases, including alternates and mirrors, and has extras such as PLL for Sq1, etc.

http://hem.bredband.net/_zlv_/rubiks/

Found it! It was
(0,-1) / (3,0) / (3,0) / (1,1) / (-4,-1) / (-3,0) / (0,1)

(So, there are two (3/0) after each other... I didn't remember that.)

Thanks!
 
This I think is the normal opp-w:
1,0 / 5,-1 / -2,1 / -1,-1 / -2,1 / 0,-3 / 3,0 / -1,-1 / -2,1 / 5,3

But I was messing around and found this, which I think is faster.

1,0 / 5,-1 / -3,0 / 1,1 / -3,0 / 0,-3 / 3,0 / -1,-1 / -2,1 / 5,3

What do you guys think of it?
 
i dont know if there is a standard really, but ive only seen that one and the one you posted. theres probably less than 20 people that know how to do it anyway

@simon i know but ive never seen it anywhere and think its quicker
 
Back
Top