• Welcome to the Speedsolving.com, home of the web's largest puzzle community!
    You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

    Registration is fast, simple and absolutely free so please, join our community of 40,000+ people from around the world today!

    If you are already a member, simply login to hide this message and begin participating in the community!

Probability Thread

Please correct me if I missed something
Non-independence across the edges.

Your answer is probably correct to an order of magnitude, but this type of question ("probability of skipping last n whatevers out of N total whatevers") is nigh impossible to answer completely correctly.

Consider the following similar question: let's say I'm a CFOP user and I don't do any multislotting. What's the probability of skipping the last slot (out of four slots, total) when solving F2L? The naïve answer is 1/15 (corner) × 1/10 (edge) = 1/150, but this is wrong. Last slot skips are much rarer than that, and more insidiously, it also depends on F2L algs used. This is not method-independent, so there's no canonical answer. The crux here is that I'm asking for a last slot skip. This is only possible if the solution to the third slot affects multiple slots (*), and even then, if it's a solution that breaks down into two triggers (e.g. R U' R' L' U L), then the first trigger already solves a different slot.

 Twizzle link 
// solving the orange-green pair
R U' R' // red-green is the third slot
L' U L // orange-green is the last slot


(*) or if you entirely skip F2L after cross, which, you know

Same problem shows up in edge pairing. What's the probability of skipping L4E on a 5×5×5, assuming I use freeslice for F8E? Naïve calculation suggests 1/8! = 1/40320, but there are factors that can decrease and other factors that can increase this value. If, during F8E, I prioritise using edge pieces that are already in the active slice and in the correct orientation to be paired up (i.e. ones where I don't need to use a flip alg), that means that what's left at the end of F8E is substantially less likely to be in compatible orientations (because the matching ones have already been used up). On the other hand, if I prioritise inserting edges to make them have matching orientations, that increases the likelihood of getting free edge pairs/triplets when I slice the centres back at the end of F8E.

(This is an actual thing I do for edge pairing on big cubes, btw. Not purely hypothetical.)

The original question by @OtaMota asked about L4E on 4×4×4. To answer this, we first need to know how the first eight edges were paired in the first place. Was it with freeslice? Was it with chain pairing (in which case, L4E skip is only possible if all of edge pairing was skipped)?

Edit: lmao, of course I wrote this before (January 2017): https://www.speedsolving.com/threads/probability-thread.20384/post-1212367
 
Last edited:
Non-independence across the edges.

Your answer is probably correct to an order of magnitude, but this type of question ("probability of skipping last n whatevers out of N total whatevers") is nigh impossible to answer completely correctly.

Consider the following similar question: let's say I'm a CFOP user and I don't do any multislotting. What's the probability of skipping the last slot (out of four slots, total) when solving F2L? The naïve answer is 1/15 (corner) × 1/10 (edge) = 1/150, but this is wrong. Last slot skips are much rarer than that, and more insidiously, it also depends on F2L algs used. This is not method-independent, so there's no canonical answer. The crux here is that I'm asking for a last slot skip. This is only possible if the solution to the third slot affects multiple slots (*), and even then, if it's a solution that breaks down into two triggers (e.g. R U' R' L' U L), then the first trigger already solves a different slot.

 Twizzle link 
// solving the orange-green pair
R U' R' // red-green is the third slot
L' U L // orange-green is the last slot


(*) or if you entirely skip F2L after cross, which, you know

Same problem shows up in edge pairing. What's the probability of skipping L4E on a 5×5×5, assuming I use freeslice for F8E? Naïve calculation suggests 1/8! = 1/40320, but there are factors that can decrease and other factors that can increase this value. If, during F8E, I prioritise using edge pieces that are already in the active slice and in the correct orientation to be paired up (i.e. ones where I don't need to use a flip alg), that means that what's left at the end of F8E is substantially less likely to be in compatible orientations (because the matching ones have already been used up). On the other hand, if I prioritise inserting edges to make them have matching orientations, that increases the likelihood of getting free edge pairs/triplets when I slice the centres back at the end of F8E.

(This is an actual thing I do for edge pairing on big cubes, btw. Not purely hypothetical.)

The original question by @OtaMota asked about L4E on 4×4×4. To answer this, we first need to know how the first eight edges were paired in the first place. Was it with freeslice? Was it with chain pairing (in which case, L4E skip is only possible if all of edge pairing was skipped)?
Free slice.
 
Looking into EO again…

Distribution of number of bad edges on all three axes:
(0, 0, 0): 1
(12, 12, 12): 1
(0, 0, 8): 3
(4, 12, 12): 3
(0, 0, 2): 48
(10, 12, 12): 48
(0, 0, 6): 48
(6, 12, 12): 48
(0, 0, 4): 108
(8, 12, 12): 108
(0, 2, 8): 576
(4, 10, 12): 576
(0, 2, 2): 1008
(10, 10, 12): 1008
(2, 10, 10): 1098
(2, 2, 10): 1098
(0, 8, 8): 3753
(4, 4, 12): 3753
(0, 2, 6): 4416
(6, 10, 12): 4416
(0, 2, 4): 6336
(8, 10, 12): 6336
(0, 4, 8): 6336
(4, 8, 12): 6336
(2, 2, 2): 12602
(10, 10, 10): 12602
(0, 4, 4): 14148
(8, 8, 12): 14148
(0, 6, 8): 14976
(4, 6, 12): 14976
(0, 6, 6): 22608
(6, 6, 12): 22608
(0, 4, 6): 29376
(6, 8, 12): 29376
(2, 2, 8): 31056
(4, 10, 10): 31056
(2, 4, 10): 38016
(2, 8, 10): 38016
(2, 6, 10): 95976
(2, 2, 6): 138636
(6, 10, 10): 138636
(2, 2, 4): 150336
(8, 10, 10): 150336
(2, 8, 8): 259056
(4, 4, 10): 259056
(2, 4, 8): 585792
(4, 8, 10): 585792
(2, 4, 4): 756576
(8, 8, 10): 756576
(2, 6, 8): 1147392
(4, 6, 10): 1147392
(2, 6, 6): 1415376
(6, 6, 10): 1415376
(4, 4, 4): 1483843
(8, 8, 8): 1483843
(2, 4, 6): 1829952
(6, 8, 10): 1829952
(4, 8, 8): 2536704
(4, 4, 8): 2536704
(4, 4, 6): 6295824
(6, 8, 8): 6295824
(6, 6, 6): 6527128
(4, 6, 8): 9836928
(4, 6, 6): 10465584
(6, 6, 8): 10465584

The denominator here is \( \frac{12!}{4!^3}\cdot2^{11}=70963200 \).

While the average number of bad edges is always 6 per axis, it's actually somewhat more common to have (4,6,6) or (4,6,8) than to have exactly (6,6,6).

The numbers of bad edges on two different axes can differ by at most 8, and this is the only constraint on the numbers of bad edges. IOW, of the sixty-five possible combinations \( \{x,y,z\} \) where \( 0\le x,y,z\le12 \) are all even and \( \max(x,y,z)-\min(x,y,z)\le8 \), all of them are actually attainable with legal cube positions.
what's the avg move count and distribution of fixed axis EO?
 
Back
Top