| n | Time (seconds) | Moves | Memory (MB) | |-----|---------------|-------|-------------| | 2 | 0.03 | 14 | 5 | | 3 | 0.08 | 80 | 8 | | 4 | 0.9 | 140 | 15 | | 5 | 4.2 | 280 | 30 | | 6 | 12.0 | 500 | 55 | | 7 | 35.0 | 800 | 90 | | 8 | 90.0 | 1200 | 150 |
# Clone the repository git clone https://github.com/dwalton76/rubiks-cube-NxNxN-solver.git cd rubiks-cube-NxNxN-solver # Initialize the solver (precomputes necessary move tables) make init Use code with caution. Copied to clipboard Source: Solve All NxNxN Cubes - Kaggle Key Components of a Python Solver pglass/cube: Python Rubik's cube solver - GitHub nxnxn rubik 39scube algorithm github python full
from rubikscubennnsolver.RubiksCube555 import RubiksCube555 from rubikscubennnsolver import SolveMoves | n | Time (seconds) | Moves |
Rapidly testing new "Reduction" heuristics before low-level optimization. Conclusion Building a full is available on GitHub:
The full implementation, including all the necessary code and documentation, is available on GitHub: