Re: [math-fun] Algorithms for Solving Rubik's Cubes

the maximum number of moves required to solve a RubikÂ’s cube with N squares per row is proportional to N^2/log N. 'That thatÂ’s the answer, and not N^2, is a surprising thing', Demaine says."

Well, not that surprising. There are Omega(24^N^2) configurations, and Omega(N) elementary moves, so the lower bound is: Omega(log(24^N^2)/log(N))) = Omega((N^2)/log(N)) Sincerely, Adam P. Goucher