I need to go from one position to another... that's all

SWErdnase

Member
Joined
Jul 10, 2015
Messages
1
Location
Malaga, Spain (English)
YouTube
Visit Channel
Hey, I'm new. Thanks for having me. This forum seems awesome.

So I want to get from one set position to another, without going through "solved". I feel like it should be possible in less than 20 moves, but all the online and app based solvers seem to just want to solve your puzzles. Pretty inconsiderate if you ask me...

Screen Shot 2015-07-10 at 03.22.06.png

I want to get from the one on the left (UD’B2DL2U2L2U2BR’U'DFD’R2BL’R’) to the one on the right (Dl'dL') but WITHOUT going through solved first.

Seems a very odd request. It is.

Can someone point me in the direction of a solver that can do it for me? or can give me an algorithm that I can use?

I'll love you forever.

Cheers!
Erdnase,
 
Here is what I would do:
1. Treat position A as solved but asigning a letter to each piece as in BLD.
2. Figure out how B differs from A and set it up that way.
3. Then you can figure out your solution.

I'm sorry if this seems kind of vague. Tomorrow I will go more in depth and give an example.
 
Expanding on Strfan's answer in more detail: You want to go from

A = (UD’B2DL2U2L2U2BR’U'DFD’R2BL’R’)

to

B = (Dl'dL')

Obviously, one way to do it is to apply (A' B). However, any algorithm that has the same effect as (A' B) will do. You should be able to use a solver to find alternative algorithms that don't necessarily "go through solved".

Another angle is to think of B as the solved state, which has been "scrambled" by applying B' and then A. So you're also looking for a solution to the "scramble" (B' A).
 
Last edited:
I'm generating a solution with CubeExplorer and will edit this post once it is finished.

Edit: I found D2 R' U2 F2 U2 L' R' U2 L F2 D2 F2 D B D L' B' L2 U' F R but it isn't optimal. The reason for that is that I messed up multiple times and then ran out of time to do an optimal search
 
Last edited:
Back
Top