> 2) I can place the first 11 edge pieces onto the cube any way I want. The orientation of the last edge piece is determined by the orientation of the first 11.
> 3) I need to track how many swaps I create by placing those pieces. An even number of swaps is solvable, and odd number is not.
Would it be equivalent to say, after placing the first 10 edge pieces, the position of the 11th is mandated, and then the orientation of the 12th is too? Or if (3) is broken might it be harder to fix than swapping the 11th and 12th?
But it introduces an artificial difference between edges and corners. You'd get the same ability for corners if you did them after the edges.
The slightly counterintuitive “magic” is that you can trade a corner swap for an edge swap: for permutation parity, corners and edges are interchangeable.
> There are 43,252,003,274,489,856,000 ways to arrange a Rubik’s cube. If I could evaluate a million arrangements per second, it would take over 1.3 million years to evaluate all arrangements. So, inspecting every individual arrangement is out.
For people who like powers of 2, that's "only" 2^65.2
That's within the realm of computability in practical timespans, if you can make the code fast and have $$$$$ to spend on compute. (modern CPU cores can do billions of operations per second, and that's not even considering GPUs)
The approach presented in the article is obviously far more efficient, but I wonder if anyone's done a "full search" of all possible cube positions before. I don't think there's any reason to do that, but that hasn't stopped people before (see: pi calculation records).
IIRC they way they proved you can always solve a cube in 20 moves was essentially a bruteforce (after eliminating symmetries) so this the closest someone have done to full search.
This is an interesting insight. The OP's constraint that no two adjacent squares are the same color ensures non-randomness. (Which reminds us why people are so bad at producing "random" sequences.)
It actually looks somewhat regular instead of random in the end. Perhaps having only rule 6 and 3, no others, is interesting. Or 6, 3 and 1. Or only rule 3 and take solution with highest entropy
I loved reading this, but I can't help but think that a "perfect scramble" would be one that can ONLY be solved in 20 moves, i.e no shortcuts can be applied to solve in less moves. I wonder how many of those exist?
Right. This reminds me of Enigma not mapping a letter to itself. Perfect isn't quite the name for this, it's constrained with the outward appearance of being unpatterned and being very patterned having only 48 arrangements of a unique solution. When we see simple patterns, we think things are not truly random, hence fake random for Spotify playlists.
Par of why this is a strange goal is that two adjacent squares can be the same color, but not be in the correct relative position for an unscrambled cube. Rubik's cube is puzzle of cubelets, not squares
That’s a great reminder that what humans consider random and what is a truly random sets of states with high entropy are typically different things. In this case out of 43 quintillion combinations, there’s only 48 that fit the human imposed random criteria. In the case of passwords, websites typically ask for lots of additional constraints in what a password must have leading to dramatic reductions in the brute force effort required to find a password.
rawling|7 months ago
> ...
> 2) I can place the first 11 edge pieces onto the cube any way I want. The orientation of the last edge piece is determined by the orientation of the first 11.
> 3) I need to track how many swaps I create by placing those pieces. An even number of swaps is solvable, and odd number is not.
Would it be equivalent to say, after placing the first 10 edge pieces, the position of the 11th is mandated, and then the orientation of the 12th is too? Or if (3) is broken might it be harder to fix than swapping the 11th and 12th?
tripa|7 months ago
But it introduces an artificial difference between edges and corners. You'd get the same ability for corners if you did them after the edges.
The slightly counterintuitive “magic” is that you can trade a corner swap for an edge swap: for permutation parity, corners and edges are interchangeable.
Retr0id|7 months ago
For people who like powers of 2, that's "only" 2^65.2
That's within the realm of computability in practical timespans, if you can make the code fast and have $$$$$ to spend on compute. (modern CPU cores can do billions of operations per second, and that's not even considering GPUs)
The approach presented in the article is obviously far more efficient, but I wonder if anyone's done a "full search" of all possible cube positions before. I don't think there's any reason to do that, but that hasn't stopped people before (see: pi calculation records).
kevindamm|7 months ago
https://www.cube20.org/
ramses0|7 months ago
Reminds me a bit of the "randomart" seeing the positions and colors of the cube splayed out like that.
HappyPanacea|7 months ago
superjan|7 months ago
fastaguy88|7 months ago
Martin_Silenus|7 months ago
[deleted]
Aardwolf|7 months ago
lutzh|7 months ago
Also a solution looking for a problem, maybe.
davidpfarrell|7 months ago
karmakaze|7 months ago
lupire|7 months ago
divbzero|7 months ago
venusenvy47|7 months ago
https://www.cube20.org/
liampulles|7 months ago
I'll keep my Rubik's Cube in this position.
pama|7 months ago