arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1601.05744math.HOcs.AI
收藏

次优多阶段路径规划:一种求解Rubik's Revenge的方法

Sub-Optimal Multi-Phase Path Planning: A Method for Solving Rubik's Revenge

Worcester Polytechnic Institute(伍斯特理工学院)

Jared Weed

摘要:

魔方的复仇,一个4x4x4的魔方的变种,至今仍然是一个未解之谜。也就是说,我们没有一种方法或成功的分类,以最佳地解决它的每一个近似$7.401 \times 10^{45}$可能的配置。魔方,魔方的复仇的前身(3x3x3),其近似$4.33 \times 10^{19}$可能的配置,最近才完全解决了Rokicki等。al,进一步发现任何配置都不需要超过20次移动。由于Rubik的复仇和它的总配置空间的纯粹维度,找到所有最优解的蛮力方法将是徒劳的。类似于Rokicki et.在本文中,我们开发了一种方法来解决任意配置的魔方的复仇阶段,使用一个强大的算法称为IDA* 和一个有用的定义在立方体空间中的距离相结合。虽然时间序列的结果没有成功地收集,它将被证明,这种方法远远超过目前的人类解决方法,可以用来确定松散的上界的立方体空间。讨论将表明,这种方法也可以应用于其他问题与适当的转换。

英文摘要:

Rubik's Revenge, a 4x4x4 variant of the Rubik's puzzles, remains to date as an unsolved puzzle. That is to say, we do not have a method or successful categorization to optimally solve every one of its approximately $7.401 \times 10^{45}$ possible configurations. Rubik's Cube, Rubik's Revenge's predecessor (3x3x3), with its approximately $4.33 \times 10^{19}$ possible configurations, has only recently been completely solved by Rokicki et. al, further finding that any configuration requires no more than 20 moves. With the sheer dimension of Rubik's Revenge and its total configuration space, a brute-force method of finding all optimal solutions would be in vain. Similar to the methods used by Rokicki et. al on Rubik's Cube, in this paper we develop a method for solving arbitrary configurations of Rubik's Revenge in phases, using a combination of a powerful algorithm known as IDA* and a useful definition of distance in the cube space. While time-series results were not successfully gathered, it will be shown that this method far outweighs current human-solving methods and can be used to determine loose upper bounds for the cube space. Discussion will suggest that this method can also be applied to other puzzles with the proper transformations.

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

↑