Welcome to the Speedsolving.com, home of the web's largest puzzle community! You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

It's not new. It's literally the inverse of R U2 R' U' R U2 L' U R' U' L but with wide R instead of L. And it definitely doesn't warrant a whole new thread.

It's not new. It's literally the inverse of R U2 R' U' R U2 L' U R' U' L but with wide R instead of L. And it definitely doesn't warrant a whole new thread.

kinda agree with @PapaSmurf , but thats also cool that you came up with your own alg. I personally find it annoying to do wide moves in solves as i am not that good at it, but, if you maybe refine this, it could be something better, you never know

I came up with an 11 move Jb perm. It's probably marginally slower than the normal one and it's one more move than the optimal one with R U L gen but it goes like this (r' F R F') (r U2 R' U) (R U2 R'). The way it works is you start with a sledgehammer except the first R' is a wide move. Then you do a wide r to fix your middle slice which moves the affected pair to the back. If you just insert the pair immediately with U R', you end up with a sune so if you just cancel directly into the sune with U2 R' U R U2 R' then BOOM J perm. Never seen this anywhere before so I thought it was cool.

It wasn't until I made this revision (i.e., I made decompositions of the algorithms and labelled each v1, v2, etc.) on the PLL wiki page that I realized many of the PLL algorithms listed under a case image are just minor modifications of the same algorithm. You can see under the "J Permutation : b:, for example, that there are 34 listed algorithms, but in fact there were only 10 actually distinct/different algorithms.

So this should be of no coincidence, since people appear to purposely modify a sequence to make it more finger-tricky. But it is also partially the case that people added an algorithm to the wiki that they found, when in fact it was technically the same as another algorithm that was already in the wiki.

It also makes sense when rewriting the resulting alg as [R U R': [F' L F, R']], so basically just a setup to a 3-cycle. And doing Lw instead of L in that comm makes it a block comm resulting in J-perm (a pair 3-cycle without the AUF).

I found a new Aa Perm! Its just a T perm but instead of R moves you use r moves. hold the headlights to the left and the block on your right. Tell me if it already exists or if I made it up