The Batch Solver - Generate large algorithm sets automatically!

[trangium]

Hi, I am trying to gen TSLE algs (for zz, inserts last f2l edge and orients corners) and BatchSOlveer keeeps crashing.

Prune: 17

Subgroup: R, U, D, r, S, M

Scramble: < R U R' U R U2 R', U> R U' R' U2

ANy heel;p[ is appreciated.

1) Your prune is too high. Try 5 for Prune and 6 for Search. This will generate algs up to length 11 (because 5+6=11), and it won't crash your computer.

2) Your current scramble generates WV, because <R U R' U R U2 R', U> basically says "do any OLL" then R U' R' U2 says "take out the pair". To fix this, put the R U' R' U2 inside the brackets.

Hope this helps.

 

[ruffleduck]

Hi, I am trying to gen TSLE algs (for zz, inserts last f2l edge and orients corners) and BatchSOlveer keeeps crashing.

Prune: 17

Subgroup: R, U, D, r, S, M

Scramble: < R U R' U R U2 R', U> R U' R' U2

ANy heel;p[ is appreciated.

Prune 17 is way too high. You'd need like over a terabyte of RAM for that lol. You don't need batch solver for this anyway; all the algs have been genned. I'd suggest using cube explorer instead for individual algs you want to generate.

 

[ProStar]

I'm just now finding this, it looks amazing!

 

[Burrito]

How would I gen TTLLs? Currently Im thinkiing if I put an alg from every subset it should work.

 

[Silky]

How would I gen TTLLs? Currently Im thinkiing if I put an alg from every subset it should work.

Not extremely elegant but I would do this
<U, R U R' F' R U R' U' R' F R2 U' R', R2 U' R2 S R2 S' U R2, F2 U R' F R' B2 R F' R' B2 R2 U' F2>

<U> Accounts for AUFs
<R U R' F' R U R' U' R' F R2 U' R'> Accounts for corner permutation in U layer (J-Perm)
<R2 U' R2 S R2 S' U R2> Accounts for edge permutation (U-Perm)
<F2 U R' F R' B2 R F' R' B2 R2 U' F2> Accounts for DFR corner permutation (Conjugated A-Perm)

If you're generating algs using batch try to think about the pieces the algset will effect ( and how it will effect them ) and apply algs you already know.

 

[Burrito]

thanks!

 

[SencelaTeo]

How would I filter out reflections and rotations if possible?

I'm trying to gen some really large algsets (~1000 cases) and I'm trying to filter out all of the reflections to reduce the necessary algorithm count as much as possible.
I did this manually with a couple algsets that had some symmetries I already figured out, but it is exhausting to work through hundreds of cases to try to find the reflections.

For example, if I generate ZBLL, the generator tells me I get 493 cases. But I have gone through every ZBLL and found that there are only really ~269 cases if I get rid of all reflections and rotations, including PLL. I literally went through every single ZBLL and found the reflections and rotations.

Another example is that Mehta-TDR has 350 cases. But reflecting cases over the F-B axis gets rid of 158 cases.

All in all, getting rid of reflections and rotations reduces Mehta-TDR from to 847 to ~427 cases, a nearly 50 percent reduction.

Is there a way to automate this? Maybe something with cube explorer?

I'm new to generating algs so sorry if the answer is obvious.

 

[speedcubr12]

If I wanted to explore some special F2L cases (like with various empty slots, or one of the pieces in the wrong slot), how would I set that up?

 

[Flummox]

Feature suggestion that I would greatly appreciate: the ability to require a certain number of a set of pieces to be solved. For example, if I wanted to solve 4 corners from a state with the corners scrambled. I could pick a specific 4 corners to always solve, but that would increase the overall number of possibilities. Instead of manually sorting through and filtering them, it would be great if the solve could do that! Also, I know this has been mentioned before, but allowing for mirroring would be great!