Each move is essentially a mathematical permutation of the array indices. 2. The Algorithm ( solver.py )

Have you built or used an NxNxN solver? Drop a link to your GitHub repo in the comments!

elements. It includes example input files and supports unit testing for verification.

in over 400 moves, current versions are far more efficient—solving a in roughly 9 moves and a in about 20.