Efficient zero-human-knowledge NN-based solver for NxNxN Rubik's cubes and general Cayley graphs
-
Updated
Jun 8, 2025 - Python
8000
Efficient zero-human-knowledge NN-based solver for NxNxN Rubik's cubes and general Cayley graphs
Generated deloopings in Agda.
Package of (Cayley) tree generators and numerical algorithms for solving tight-binding models on these trees
Add a description, image, and links to the cayley-graph topic page so that developers can more easily learn about it.
To associate your repository with the cayley-graph topic, visit your repo's landing page and select "manage topics."