2

So say you have a Rubik's cube in a certain state (you can make your own assumptions about what state, I'm guessing the majority of states give about the same answer) and you alter it by randomly and uniformly choosing moves, one after another. Here a move is defined as rotation of a face of the cube either 1, 2, or 3 times (you can't leave the cube the way it is). How many moves on average would it take to solve it? Also, how would you generalize this problem, or what are some general techniques to handle it?

Olorun
  • 1,621
Vik78
  • 3,963
  • 2
    Related: http://math.stackexchange.com/questions/1608168/random-solving-of-a-rubik-cube – turkeyhundt Sep 22 '16 at 05:21
  • This is not quite a duplicate of the stated question: there you start in a solved state and want to get back to a solved state by random moves. Here, starting from a not-necessarily-solved state, things seem to get more complex than that -- at least the argument that carries the day in the other question won't work here without some adjustment. – hmakholm left over Monica Dec 22 '16 at 13:49

0 Answers0