Seminario Samuel Gitler

3 de diciembre de 2025. 12:30 hrs. Salón 238, Departamento de Matemáticas

Próxima conferencia

3 de diciembre. 12:30 hrs.

Salón 238, Departamento de Matemáticas

Unirse a Zoom
ID de la reunión: 868 2424 3479
Contraseña: 040480

Prof. Alexey M. Romanov
MIREA — Russian Technological University, Moscow, Russia

A machine learning approach that beats Rubik's cubes

Resumen: The paper proposes a novel machine learning-based approach to the pathfinding problem on extremely large graphs. This method leverages diffusion distance estimation via a neural network and uses beam search for pathfinding. We demonstrate its efficiency by finding solutions for 4x4x4 and 5x5x5 Rubik’s cubes with unprecedentedly short solution lengths, outperforming all available solvers and introducing the first machine learning solver beyond the 3x3x3 case.

In particular, it surpasses every single case of the combined best results in the Kaggle Santa 2023 challenge, which involved over 1,000 teams. For the 3x3x3 Rubik’s cube, our approach achieves an optimality rate exceeding 98%, matching the performance of task-specific solvers and significantly outperforming prior solutions such as DeepCubeA (60.3%) and EfficientCube (69.6%). Our solution in its current implementation is approximately 25.6 times faster in solving 3x3x3 Rubik’s cubes while requiring up to 8.5 times less model training time than the most efficient state-of-the-art competitor. Finally, it is demonstrated that even a single agent trained using a relatively small number of examples can robustly solve a broad range of puzzles represented by Cayley graphs of size up to 10^145, confirming the generality of the proposed method.