What depth of recursion, in theory, is enough to calculate the optimal way to collect the Rubik's Cube?

Of course, to collect it, there are special algorithms and all that. But I would like to know, purely through all possible operations on the cube, what depth of recursion will be enough to collect it? For example, assume the existence of a 17-20 running track.

    2 answers 2

    Wikipedia says :

    Finally, in August 2010, a group led by Professor Morley Davidson reported that, using the computer time free from processing search queries of one of Google Inc.'s supercomputers, they were able to prove that from any position the Rubik's cube could be assembled in no more than 20 moves. However, this result has not yet been verified.

    Therefore, the depth of recursion, most likely, does not exceed 20, and in the worst case it is reached.

    • one
      The fact that there is an algorithm with which you can assemble a cube in 20 moves does not mean that in the process of its search there will be no dead-end branches with a large number of moves (or winning algorithms, again with a large number of moves). - insolor
    • 3
      So in my opinion it is clearly written that if we went beyond 20 moves + epsilon, then this branch of the decision can not be immediately considered. Because there will be a shorter solution. - gecube pm

    Take one of the optimal algorithms and calculate its worst case, since the size of the input data is known.