So basically, I want to see how to calculate the optimal solutions (or the most move it takes) to solve one part of a cube like 2x2x2, 1x2x2, 1x1x2, 2x2x3, 2x2x3 + 1x2x2, and F2L...with color neutrality. Does anyone know of a program that does that?
I assume you know about Johannes's optimal 2x2x2 block solver, but it's not color neutral. To deal with that, you can use Cube explorer to generate an rotated scramble.
I assume you know about Johannes's optimal 2x2x2 block solver, but it's not color neutral. To deal with that, you can use Cube explorer to generate an rotated scramble.
But I need to generate like 24 scrambles for one case...
I assume you know about Johannes's optimal 2x2x2 block solver, but it's not color neutral. To deal with that, you can use Cube explorer to generate an rotated scramble.
But I need to generate like 24 scrambles for one case...
Wouldn't that be 8? one for each corner?
24 for 2x2x3.
I assume you know about Johannes's optimal 2x2x2 block solver, but it's not color neutral. To deal with that, you can use Cube explorer to generate an rotated scramble.
But I need to generate like 24 scrambles for one case...
Wouldn't that be 8? one for each corner?
24 for 2x2x3.
If you're only looking at specific scrambles, Johannes wrote one for cross, 2x2x2 and 1x2x2 extension.
-DR -UB UL -UR -DF BL -BR -FL FR UF DB DL +DLB ULF -DFL +DBR +UBL -DRF +UFR +URB
@? -UB UL @? @? BL @? @? @? @? @? @? @? @? @? @? +UBL @? @? @?