![]() Unfortunately, because from every state, there are edges to 18 different states, every next layer of the BFS will be up to 18 times bigger than the previous one. ![]() Hence BFS algorithm would go at most 20 nodes deep in the search. It is a known fact that the optimal solution for the Rubik's cube consists of at most 20 moves. Since the graph is unweighted (every move counts the same) the shortest path can be found using a graph traversal algorithm such as BFS. Therefore, the optimal solution is the shortest path between the initial state of the cube and the state of the solved cube. My solution to the optimal Rubik's cube move sequence problem uses graph theory.Įvery Rubik's cube state can be represented as a vertex in a graph and making a move as an edge between different vertexes. A program for finding optimal Rubik's cube solution Description Initial idea
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |