基于GNNs的魔方图节点分类与搜索
Node Classification and Search on the Rubik's Cube Graph with GNNs
AI总结:
本研究提出将3x3x3魔方距离近似转化为节点分类问题,利用GNNs在随机子图上训练以构建$A^*$搜索的启发式函数,并与DeepCubeA模型进行了实验对比。
摘要:
本研究聚焦于应用深度几何模型解决3x3x3魔方。我们首先讨论了魔方的图表示,并将距离定义为模型的优化目标。距离近似任务被重新表述为节点分类问题,并使用图神经网络(GNNs)有效解决。在随机子图上训练模型后,预测的类别被用于构建$A^*$搜索的启发式函数。最后,我们通过实验将我们的启发式函数与DeepCubeA模型进行了比较。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。