arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2412.01937cs.AIcs.DMcs.LGcs.NE
收藏

高维滑块谜题的近似最优搜索

Approximately Optimal Search on a Higher-dimensional Sliding Puzzle

Center for Scalable Data Analytics and Artificial Intelligence(可扩展数据分析与人工智能中心);Universität Leipzig(莱比锡大学);Max Planck Institute for Mathematics in the Sciences(马克斯·普朗克数学科学研究所);Duke University(杜克大学)

Nono SC Merleau, Miguel O'Malley, Érika Roldán, Sayan Mukherjee

AI总结:

针对高维滑块谜题,论文基准比较 A*、EA 与 RL,发现高维下 A* 失效,而 EA 与 RL 可给出中位数低于30步的近似最优解。

摘要:

高维滑块谜题构建在一个 $d$ 维超立方体的顶点上,其中 $2^d-l$ 个顶点被赋予不同颜色。具有相同颜色的环最初被随机放置在超立方体的顶点上。谜题的目标是将 $2^d-l$ 个环中的每一个移动到立方体上预先定义的目标顶点。在这一设定中,$k$ 规则约束表示颜色在顶点之间移动时边缘碰撞的一种推广:只有当包含某个环的一个 $k$ 维超立方体面完全没有其他环时,才允许移动。从初始构型出发,使环的颜色与顶点颜色相匹配所需的最少移动次数是多少?能够给出这一数字的算法称为上帝算法。当这种算法存在时,它并不具有多项式时间复杂度,至少在对应于立方体谜题中 $k=1$ 的十五数码谜题情形下如此。本文对该高维谜题的不同情形进行了全面的计算研究。本工作提出了一个包含三种计算技术的基准:一种精确算法(A* 搜索)和两种近似最优搜索技术(进化算法(EA)与强化学习(RL))。实验表明,这三种方法都能成功求解三维谜题,适用于不同的面维度以及各种难度级别。当维度增加时,A* 搜索会失败,而 RL 和 EA 方法仍能给出总体上可接受的解,即移动次数分布的中位数小于 $30$。总体而言,EA 方法始终需要更少的计算时间,但在谜题维度 $d=4$ 和 $d=5$ 的大多数情况下无法最小化移动次数。

英文摘要:

Higher-dimensional sliding puzzles are constructed on the vertices of a $d$-dimensional hypercube, where $2^d-l$ vertices are distinctly coloured. Rings with the same colours are initially set randomly on the vertices of the hypercube. The goal of the puzzle is to move each of the $2^d-l$ rings to pre-defined target vertices on the cube. In this setting, the $k$-rule constraint represents a generalisation of edge collision for the movement of colours between vertices, allowing movement only when a hypercube face of dimension $k$ containing a ring is completely free of other rings. Starting from an initial configuration, what is the minimum number of moves needed to make ring colours match the vertex colours? An algorithm that provides us with such a number is called God's algorithm. When such an algorithm exists, it does not have a polynomial time complexity, at least in the case of the 15-puzzle corresponding to $k=1$ in the cubical puzzle. This paper presents a comprehensive computational study of different scenarios of the higher-dimensional puzzle. A benchmark of three computational techniques, an exact algorithm (the A* search) and two approximately optimal search techniques (an evolutionary algorithm (EA) and reinforcement learning (RL)) is presented in this work. The experiments show that all three methods can successfully solve the puzzle of dimension three for different face dimensions and across various difficulty levels. When the dimension increases, the A* search fails, and RL and EA methods can still provide a generally acceptable solution, i.e. a distribution of a number of moves with a median value of less than $30$. Overall, the EA method consistently requires less computational time, while failing in most cases to minimise the number of moves for the puzzle dimensions $d=4$ and $d=5$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑