Given a Rubik's cube of NxNxN, is there a general formula to find S where S is the minimum number of moves needed to solve any initial starting configuration?