reThinking the Cube
Member
- Joined
- Dec 11, 2009
- Messages
- 294
Here is the well known distribution table for min#of moves to solve 2x2x2.
n f
0
0 1
1 9
2 54
3 321
4 1847
5 9992
6 50136
7 227536
8 870072
9 1887748
10 623800
11 2644
12 0
13 0
14 0
Total 3674160
How many of these 3,674,160 positions would yield a scrambled cube with no more than one correctly placed piece? (simultaneously - nothing else solved except for 1 arbitrary reference corner).
+10 Bonus: a table (min#of moves to solve) like the one above for just those positions.
.
n f
0
0 1
1 9
2 54
3 321
4 1847
5 9992
6 50136
7 227536
8 870072
9 1887748
10 623800
11 2644
12 0
13 0
14 0
Total 3674160
How many of these 3,674,160 positions would yield a scrambled cube with no more than one correctly placed piece? (simultaneously - nothing else solved except for 1 arbitrary reference corner).
+10 Bonus: a table (min#of moves to solve) like the one above for just those positions.
.