• Welcome to SpeedSolving.com — the world’s largest puzzle community!

    You’re currently browsing as a guest, which means you have limited access to discussions, resources, member profiles, and community features.

    Join 50,000+ cubers and puzzle enthusiasts from around the world to ask questions, share solves, improve faster, and be part of the community.

    Registration is free, fast, and easy — create your account today.

    Already a member? Log in here to hide this message and start participating.

Probability Thread

If you mean all centers, I got a number that had like 47 digits.

If someone wants to check my math, I did 24! and squared it.
You need to account for the fact that there are many center states that are considered solved. Also that a 2-swap of centers is not possible. The total number of center states is (24!)^2 / 2
The number of solved states can be computed like this:
6 (faces) x (4!)^2 (permutations per face that are considered solved) / 2 (eliminate parity)
So the probability is
((24!)^2/2) / (6x(4!)^2/2) = (24!)^2/(6x(4!)^2)
Lmk if something is wrong
 
You need to account for the fact that there are many center states that are considered solved. Also that a 2-swap of centers is not possible. The total number of center states is (24!)^2 / 2
The number of solved states can be computed like this:
6 (faces) x (4!)^2 (permutations per face that are considered solved) / 2 (eliminate parity)
So the probability is
((24!)^2/2) / (6x(4!)^2/2) = (24!)^2/(6x(4!)^2)
Lmk if something is wrong
111387794911264837077470197382224281600000000
 
You need to account for the fact that there are many center states that are considered solved. Also that a 2-swap of centers is not possible. The total number of center states is (24!)^2 / 2
The number of solved states can be computed like this:
6 (faces) x (4!)^2 (permutations per face that are considered solved) / 2 (eliminate parity)
So the probability is
((24!)^2/2) / (6x(4!)^2/2) = (24!)^2/(6x(4!)^2)
Lmk if something is wrong
Can't you just "solve" parity by just doing a swap of one green center and another green center while doing another swap?

Since green swapping with green isn't visible, I think it would do the equivalent of a one swap, while technically being a two swap alg.
 
Can't you just "solve" parity by just doing a swap of one green center and another green center while doing another swap?

Since green swapping with green isn't visible, I think it would do the equivalent of a one swap, while technically being a two swap alg.
Yeah now that I think about it, you can swap two centers and two wings, amounting to any center state being possible. This doesn't matter for the probability though, because I divided both the numerator and the denominator by 2 and cancelled them.
Thanks for the correction!
 
Also that a 2-swap of centers is not possible.
Yeah now that I think about it, you can swap two centers and two wings, amounting to any center state being possible.
The t-centres and wings have the same parity, so you can do 2-cycle t-centres + 2-cycle wings.

The x-centres and corners and midges have the same parity, so you can do 2-cycle x-centres + 2-cycle corners + 2-cycle midges. (edit: forgot about midges, oops)
 
Last edited:
Back
Top