About

Generalized Rubik's cubes with rectangular short faces c₁×c₂ and long axis length n combine combinatorial search with rich group structure. For fixed face sizes, Demaine et al. proved optimal solutions can be found in time polynomial in n.

Foundation

This project implements Section 6 of Algorithms for Solving Rubik's Cubes and extends it with a unified search laboratory for empirical comparison.

Demaine, Demaine, Eisenstat, Lubiw, Winslow — arXiv:1106.5736 →

Cite this work

@misc{godsalgorithm2026,
  title  = {God's Algorithm for Generalized Rubik's Cubes:
            A Polynomial Optimal Solver and Modular Search Framework},
  author = {Chandra, Shyamal Suhana and {Sapana Micro Software}},
  year   = {2026},
  note   = {Research paper and benchmark results}
}

Acknowledgments

We thank the authors of Demaine et al. for the foundational algorithm. This site presents published results and the paper only — not solver source code.