Playing around with automatic, optimal rubiks cube solving using bidirectional breadth first search. The current implementation works - for cubes which require less than about 16 turns to solve. For more complex scrambles, this program will eventually find the optimal solution (if given enough time and memory), it's just not practical.
-
Notifications
You must be signed in to change notification settings - Fork 0
iggedi-ig-ig/cubers
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A toy project where I play around with automatic solving of rubiks cubes using bidirectional breadth first search