Short Square-1 Algorithm

[Cyrus C.]

I need the shortest square-1 algorithm for switching a 2 square-1 edges one from the bottom layer, one from the top. Could someone please tell me where to have the edges before the start, & the algorithm. I'm trying to come up with a different way of doing the edges that breaks it down, is less algorithmic & easier to understand.

 

[Muesli]

CLICK MEEEE

 

[DavidWoner]

UF and DR

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

This is what I use for parity when doing roux on sq1.

 

[qqwref]

If you don't care about the permutation of edges and just want to sort them, I use this:

place edges at UB and DF
(0,-1) / (-3, 0) / (4, 1) / (-4,-1) / (3,0) / (0,1)

 

[Cyrus C.]

If you don't care about the permutation of edges and just want to sort them, I use this:

place edges at UB and DF
(0,-1) / (-3, 0) / (4, 1) / (-4,-1) / (3,0) / (0,1)

Am I missing something? You can't do a -1 can you?

 

[liljthedude]

Rotate your Square-1 over to the opposite side. (Cube Rotation)

 

[Cyrus C.]

I still don't get what I'm supposed to do.

 

[qqwref]

I don't know if you're already doing this, but for most algs to work you have to hold the puzzle so that on the middle layer, on the front face, the left sticker is smaller than the right. (0,-1)/ should be possible from a solved position.