In particular MIT computer scientist Erik Demaine and colleagues have shown:
...[T]hat 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.(Via Reid A.)