期刊
SIAM REVIEW
卷 56, 期 4, 页码 645-670出版社
SIAM PUBLICATIONS
DOI: 10.1137/140973499
关键词
group theory; algorithm performance; Rubik's Cube
We give an expository account of our computational proof that every position of the Rubik's Cube can be solved in 20 moves or fewer, where a move is defined as any twist of any face. The roughly 4.3x10(19) positions are partitioned into about two billion cosets of a specially chosen subgroup, and the count of cosets required to be treated is reduced by considering symmetry. The reduced space is searched with a program capable of solving one billion positions per second, using about one billion seconds of CPU time donated by Google. As a byproduct of determining that the diameter is 20, we also find the exact count of cube positions at distance 15.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据