O
Owen
Guest
Just use a regular 4x4x4 scramble, and solve everything but the last layer. Wow people, don't be lazy.
Just use a regular 4x4x4 scramble, and solve everything but the last layer. Wow people, don't be lazy.
Surely we all can agree that if 2, 3, or 4 (and probably 5) wings unsolved is not considered a scramble.
I didn't check too many scrambles, but those seem okay (nice distribution of the pieces, about 50% orientation and about 50% permutation parity). It is also pretty efficient, but not optimal.
Just use a regular 4x4x4 scramble, and solve everything but the last layer. Wow people, don't be lazy.
I didn't check too many scrambles, but those seem okay (nice distribution of the pieces, about 50% orientation and about 50% permutation parity). It is also pretty efficient, but not optimal.
Edit, I forgot to mention: Scramble length can be easily increased for more randomness, but I think 35 moves is okay.
moves count count if final AUF ignored
11 0 2
12 2 1
13 11 14
14 4 14
15 86 108
16 56 240
17 414 290
18 162 600
19 1495 1593
20 1170 3443
21 6146 6486
22 5589 9851
23 15269 12888
24 7108 3978
25 2729 807
26 76 4
27 2 0
----- -----
40319 40319
use yau its a better method (i learned it in a day and started averaging sub 65 seconds)
I could change the code to consider there to be 4 solved states instead of 1. This would allow eliminating the AUF at the end of a scramble. For some cases, all optimal <U,r> scrambles start with a U layer move. For example, for the UL-UR dedge swap, all optimal <U,r> scrambles start with a U or U' move. So you can't assume the scramble can start with an r layer move.Interesting distribution. I'm a bit surprised at how quickly it drops off, and how the odd numbers seem to be higher than the next even number.
I think, for speed purposes, it would not be too crazy to hard-code in the 26 and 27 move cases, and then only search up to 25 moves. What do you think? (Also: If we don't count AUF before and after, how does that improve the search speed?)
Kirjava, can I email you a half-megabyte zip file at the email address on your K4 page? Also, I would like to know what data you want. I have generated all optimal scrambles (for the corners solved states) as well as 1 per case. Right now, my one per case data set has cases where the scramble could be replaced by a maneuver where an AUF could be omitted at the end. So if you want scrambles that are "optimized" in this way, I can send the maneuvers after I regenerate the data in that manner.cuBerBruce: can you paste the list somewhere? this is pretty much exactly what we need
Kirjava, can I email you a half-megabyte zip file at the email address on your K4 page? Also, I would like to know what data you want. I have generated all optimal scrambles (for the corners solved states) as well as 1 per case. Right now, my one per case data set has cases where the scramble could be replaced by a maneuver where an AUF could be omitted at the end. So if you want scrambles that are "optimized" in this way, I can send the maneuvers after I regenerate the data in that manner.