Shortest paths when randomly scrambling a Rubik's cube I saw a previous question about local maxima for the number of moves in a Rubik's cube solution, and I wondered what is known about the distribution of shortest paths when randomly scrambling a Rubik's cube.


  
  If I were to pick a (solvable) configuration at random, how far is it
  to the solved state? 
  How many random moves does it take to sufficiently scramble the cube?
  


For the second question, I'm thinking of it as the mixing time, like for the Diaconis 7 shuffle result for a deck of cards. (Perhaps this is the wrong terminology?)

This is related to another question of mine about adversarially scrambling a Rubik's cube.

Edit: I accepted Marzio's answer, though I still wonder about the mixing time. Google revealed some results for particular finite groups, but I didn't see anything about Rubik's cube. Maybe one of these is applicable / can be ported over?
At God's number is 20 site you can find a nice distance/count table:



"... Distance-20 positions are both rare and plentiful; they are rarer than one in a billion positions, yet there are probably more than one hundred million such positions. We do not yet know exactly how many there are. The table on the right gives the count of positions at each distance; for distances 16 and greater, the number given is just an estimate. Our research has confirmed the prior results for entries 0 through 14 below, and the entry for 15 is a new result, which has since been independently confirmed by another researcher ...."

According to the table if you pick a random configuration it will be with high probability at distance 17-18 from the solution.

See also D. Joyner's notes Mathematics of the Rubik's cube (and D. Joyner's book "Adventures in Group Theory: Rubik’s Cube, Merlin’s Machine, and Other Mathematical Toys")