Node Classification and Search on the Rubik's Cube Graph with GNNs

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteur principal: Barro, Alessandro
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929693031137280
author Barro, Alessandro
author_facet Barro, Alessandro
contents This study focuses on the application of deep geometric models to solve the 3x3x3 Rubik's Cube. We begin by discussing the cube's graph representation and defining distance as the model's optimization objective. The distance approximation task is reformulated as a node classification problem, effectively addressed using Graph Neural Networks (GNNs). After training the model on a random subgraph, the predicted classes are used to construct a heuristic for $A^*$ search. We conclude with experiments comparing our heuristic to that of the DeepCubeA model.
format Preprint
id arxiv_https___arxiv_org_abs_2501_18580
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Node Classification and Search on the Rubik's Cube Graph with GNNs
Barro, Alessandro
Machine Learning
This study focuses on the application of deep geometric models to solve the 3x3x3 Rubik's Cube. We begin by discussing the cube's graph representation and defining distance as the model's optimization objective. The distance approximation task is reformulated as a node classification problem, effectively addressed using Graph Neural Networks (GNNs). After training the model on a random subgraph, the predicted classes are used to construct a heuristic for $A^*$ search. We conclude with experiments comparing our heuristic to that of the DeepCubeA model.
title Node Classification and Search on the Rubik's Cube Graph with GNNs
topic Machine Learning
url https://arxiv.org/abs/2501.18580