An attempt at solving Rubik's cube by classical graph search algorithms, i.e. DFS, BFS, and A*. The problem is complex as the number of Rubik's states possible by applying a sequence of operators is 43,252,003 274,489,856,000 (S. VAUGHEN, “Counting the Permutations of the Rubik's Cube”, Miami Dade College). Hence a custom approach to the problem.
-
Notifications
You must be signed in to change notification settings - Fork 0
A Rubik's cube solver with A*, BFS, and DFS algorithms, as well as their hybrid solutions.
License
old-zet/a-star_rubiks-cube
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
A Rubik's cube solver with A*, BFS, and DFS algorithms, as well as their hybrid solutions.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published