Peeling off the stickers to solve the cube

adimare

Veteran
Joined
Oct 29, 2009
Messages
374
Location
Costa Rica
WCA ID
2011MARE02
An old teacher from college visited me today to wish me a happy new year. When she saw my new un-stickered type C on the table she told me I should put the stickers on at random, and then try to solve it. I told her that would most likely result in an unsolvable cube, and proceeded to explain why, and then how to solve the cube, etc.

But that got me thinking in the following problem: if you put your 54 stickers completely at random on your cube, what's the probability that your cube will be solvable? I would consider a given state solvable if you can get a single color on each face by performing turns on the cube, the color scheme being irrelevant.

If you don't wanna try it out on your own this is what I came up with:
First, I calculated the different ways in which the cube could be stickered.
To figure this out I imagine placing a number in each cubie face that will be stickered, so I have 54 stickers and 54 positions where they can be applied. The number of ways this can be done is 54!. However, I must also consider the fact that I don't really have 54 different stickers, I have 6 sets of 9 stickers (stickers in each set are identical), which means that any random stickering can be made (9!)^6 different ways, so I only really have 54!/9!^6 ways to randomly sticker the cube.

What about cube rotations? Due to them, every single random stickering I produce will actually appear 24 times, so my final number of possible ways to sticker the cube is:

54! x 1/9!^6 x 1/24

Now I only need to figure out how many of those are solvable:
I consider a state solvable if you can get a single color in each face. The amount of different states a solvable cube can be in is:
8! x 3^7 x 12! x 2^10

But this is only for a particular color scheme, this number should be multiplied by the amount of color schemes that the cube can have with 6 sets of 9 stickers. If we were to choose a color for each face in the following order: U F D B L R. We'd have 6! ways to choose our scheme. However, many of those will be identical after a couple of cube rotations, so the actual number of color schemes is 6!/24, which is 30.

So my calculated probability for randomly stickering a cube into a solvable state would be:

[8! x 3^7 x 12! x 2^10 x 30] / [54! x 1/9!^6 x 1/24]

That's about 3.08x10^-16, or in percentage:

a 0.0000000000000308% probability

I'm fairly new to the cube, so any corrections would be appreciated.
 
I get exactly the same answer as you, although I just went for dividing by all permutations:

(6!*43252003274489856000*(9!)^6)/54!
= 40122452017152 / 130253249618151492335575683325
≈ 3.080341729 * 10^-16

Nice problem. :)
 
I get exactly the same answer as you, although I just went for dividing by all permutations:

(6!*43252003274489856000*(9!)^6)/54!
= 40122452017152 / 130253249618151492335575683325
≈ 3.080341729 * 10^-16

Nice problem. :)

I did the method that Lucas did, though with a slightly different (and overall inconsequential) interpretation on the identical stickers.
 
That's an interesting thing to think about, I'll think through it some more before I spoiler it. Main thing I can think of that would make this a bad idea, unless you were paying attention, would be putting the same color on two centers, instantly ruining everything. I'll think this through though....

...it's 1 in 12 chance of being solvable if you sticker it properly then take apart and put back together again randomly, right?
 
Without looking at any other posts first I would say:

43252003274489856000 * 24 * (9!)^6 / (54!) ~ 1 * 10^-17

--edit--
Ooooh very neat, I forgot to include all possible color schemes. Yes I agree with the factor of 30 so readjusted:
43252003274489856000 * 24 * 30 * (9!)^6 / (54!) ~ 3 * 10^-16

Chris
 
Last edited:
yeah i think your overall possible solvable states was very estimated, so a wide error was expected, too bad im only an applicable mathmatician and astrophysisist, not so good in statistical anylisis and solving lol
 
An old teacher from college visited me today to wish me a happy new year. When she saw my new un-stickered type C on the table she told me I should put the stickers on at random, and then try to solve it. I told her that would most likely result in an unsolvable cube, and proceeded to explain why, and then how to solve the cube, etc.

But that got me thinking in the following problem: if you put your 54 stickers completely at random on your cube, what's the probability that your cube will be solvable? I would consider a given state solvable if you can get a single color on each face by performing turns on the cube, the color scheme being irrelevant.

If you don't wanna try it out on your own this is what I came up with:
First, I calculated the different ways in which the cube could be stickered.
To figure this out I imagine placing a number in each cubie face that will be stickered, so I have 54 stickers and 54 positions where they can be applied. The number of ways this can be done is 54!. However, I must also consider the fact that I don't really have 54 different stickers, I have 6 sets of 9 stickers (stickers in each set are identical), which means that any random stickering can be made (9!)^6 different ways, so I only really have 54!/9!^6 ways to randomly sticker the cube.

What about cube rotations? Due to them, every single random stickering I produce will actually appear 24 times, so my final number of possible ways to sticker the cube is:

54! x 1/9!^6 x 1/24

Now I only need to figure out how many of those are solvable:
I consider a state solvable if you can get a single color in each face. The amount of different states a solvable cube can be in is:
8! x 3^7 x 12! x 2^10

But this is only for a particular color scheme, this number should be multiplied by the amount of color schemes that the cube can have with 6 sets of 9 stickers. If we were to choose a color for each face in the following order: U F D B L R. We'd have 6! ways to choose our scheme. However, many of those will be identical after a couple of cube rotations, so the actual number of color schemes is 6!/24, which is 30.

So my calculated probability for randomly stickering a cube into a solvable state would be:

[8! x 3^7 x 12! x 2^10 x 30] / [54! x 1/9!^6 x 1/24]

That's about 3.08x10^-16, or in percentage:

a 0.0000000000000308% probability

I'm fairly new to the cube, so any corrections would be appreciated.

Wow, you are REALLY smart. I can't beleive you worked this out. It seems like a really interesting concept.
 
This was my method, I haven't read the other solutions yet so excuse me if someone else has used the same method

Solvable Permutations
We start with the normal 43 quintillion permutations but since it could have any colour scheme we need to find out how many different colours schemes there could be.

Let the six colours A,B,C,D,E and F. A will allways be on the front face on the solved cube. A and B could either be opposite (when we rotate the cube so C is on the up face or adjacent when we rotate the cube so that it is on the up face

For the first instance we have 3! ways of stickering the remaining faces and for the second 4! giving us 30 colour schemes

30 x 43 252 003 274 489 856

Number of Permutations
I realised that there would be 54! ways of stickering the cube but not all would be different as there are only 6 different coulered stickers. However on a side the stickers can be arranged in 9! different ways yet still appear the same. Applying this to the whole cube we get 54!/9!^6 ways to sticker it.

Edit : however we can have 24 different roations of the cube so we divide by 24 giving 54!/9!^6/24

The answer

So we do solvable permutations/permutationsgiving us 54!/9!^6/24/30/43 252 003 274 489 856 or 1/3 246 393 055 999 402

Edit: missed some cube rotations in total permutations
 
Last edited:
Back
Top