Cube Explorer Cross Scrambles

[CubeBruh]

Hello. I was wondering how you could use cube explorer create scrambles where the cross was solved or solve from cross. If I just put all of the cross edge pieces solved I get too many solutions that have more than the cross solved because the software interprets any possible orientation of the other pieces. Consequently, there are too many 6-8 move scrambles that have like half of the F2L or OLL solved. As well, I do not think I can filter for a number of moves computed (i.e. i want the scramble to have 14 moves).

For those of you who want more context, chaotimer has the option to get a scramble with the cross solved. I want to replicate that using cube explorer.

 

[Christopher Mowla]

Right clicking on the stickers tells Cube Explorer that you want to ignore those stickers. So this is what you want to do. Then click [Add and Solve].

But this will take forever to even get to the first 14f sequence.

I am not sure if you want to use this for an official scrambler or if this is just for personal practice, but if it is for public use, you may want to think of another way (an existing resource) to do this besides using Cube Explorer. But if it is for personal use, you can simply do one 7 move sequence after another is finished to create a 14 move algorithm/scramble. (Because both 7 move sequences will not disrupt the first layer cross edges.)

EDIT:
If you really want to use Cube Explorer (and the waiting time "would be worth it"), you can consider not allowing a couple of turns. Maybe these. (It arrived at the first 9f sequence in about two minutes.) By default, it is guaranteed that we can reach all possible scrambles if we have one of those faces checked. If two or more are checked, then the number of potential scrambles starts to decrease.

You want to allow (leave unchecked!) either B or F, otherwise your scrambles will be guaranteed to not change edge orientation. (So that's why I didn't check both B and F, just B). I checked D because that's the layer where the solved cross edges are. Since Cube Explorer doesn't allow you to check R and U, this means that the scrambles will consist of <R,U,L,F>.

It's very possible (I can't prove it at the moment), that you can attain all corner scrambles from scrambles in <R,U,L,F>. (So this may be a more feasible search parameter to wait for than allowing all 6 face turns.)

• Maybe someone will pull up Jaap's subgroup webpages to confirm/contradict this claim.
  
  
• I know for certain that all corner scrambles can be attained from scrambles in <L,R,F,B>. See this post.

EDIT2:
Yeah, I just checked Jaap's subgroup page and saw U, D, F, R (which is the same as <R,U,L,F>). All corner permutations and orientations can be reached. And it looks like it can affect 11 out of the 12 edges (both permutation and orientation). The only edge <U,D,F,R> cannot affect is obviously (by observation) BL.

Similarly, the only edge <R,U,L,F> cannot effect is DB. Therefore <R,U,L,F> is sufficient to generate all possible scrambles if we assume that the solved cross edges are in the D face. So the above search parameter is perfectly okay to use for your purposes. I am not sure how long it would take to get to the first 14f solution (it's probably still going to take forever, but a lesser forever than if we allow all turns!) But at the same time, a 14 move <R,U,L,F> solution will probably generate an "easier case" than a 14 move <U,D,F,B,L,R> solution.

 

[CubeBruh]

Right clicking on the stickers tells Cube Explorer that you want to ignore those stickers. So this is what you want to do. Then click [Add and Solve].

But this will take forever to even get to the first 14f sequence.

I am not sure if you want to use this for an official scrambler or if this is just for personal practice, but if it is for public use, you may want to think of another way (an existing resource) to do this besides using Cube Explorer. But if it is for personal use, you can simply do one 7 move sequence after another is finished to create a 14 move algorithm/scramble. (Because both 7 move sequences will not disrupt the first layer cross edges.)

EDIT:
If you really want to use Cube Explorer (and the waiting time "would be worth it"), you can consider not allowing a couple of turns. Maybe these. (It arrived at the first 9f sequence in about two minutes.) By default, it is guaranteed that we can reach all possible scrambles if we have one of those faces checked. If two or more are checked, then the number of potential scrambles starts to decrease.

You want to allow (leave unchecked!) either B or F, otherwise your scrambles will be guaranteed to not change edge orientation. (So that's why I didn't check both B and F, just B). I checked D because that's the layer where the solved cross edges are. Since Cube Explorer doesn't allow you to check R and U, this means that the scrambles will consist of <R,U,L,F>.

It's very possible (I can't prove it at the moment), that you can attain all corner scrambles from scrambles in <R,U,L,F>. (So this may be a more feasible search parameter to wait for than allowing all 6 face turns.)

• Maybe someone will pull up Jaap's subgroup webpages to confirm/contradict this claim.
  
  
• I know for certain that all corner scrambles can be attained from scrambles in <L,R,F,B>. See this post.

EDIT2:
Yeah, I just checked Jaap's subgroup page and saw U, D, F, R (which is the same as <R,U,L,F>). All corner permutations and orientations can be reached. And it looks like it can affect 11 out of the 12 edges (both permutation and orientation). The only edge <U,D,F,R> cannot affect is obviously (by observation) BL.

Similarly, the only edge <R,U,L,F> cannot effect is DB. Therefore <R,U,L,F> is sufficient to generate all possible scrambles if we assume that the solved cross edges are in the D face. So the above search parameter is perfectly okay to use for your purposes. I am not sure how long it would take to get to the first 14f solution (it's probably still going to take forever, but a lesser forever than if we allow all turns!) But at the same time, a 14 move <R,U,L,F> solution will probably generate an "easier case" than a 14 move <U,D,F,B,L,R> solution.

Hey! Thanks, this is very helpful. I think continuing to combine 7f moves is probably sufficient for my purposes, but leaving the B or F faces unchecked is also a feasible alternative. Thank you very much!