Talk:Rubik's Cube Fact sheet
"Tom Rokicki has proved that all positions can be solved in 22 or fewer moves, so it is unknown what the exact upper bound is."
Thought some computer scientist recently used Google's servers to test every single scramble, and found that the upper bound is exactly 20 ?
- Hi Goosly (me is 'Kenta' from the Swedish chatroom) =)
- Yes, true, the page needs an update. If I remember it correctly one in the team that made the work is this Rokicki. // Kenneth 07:01, 13 February 2011 (EST)