← 研踪 PaperTrailarXiv:2611.11018 · v1
Solving Large Rubik's Cubes within a Factor of $2.37+o(1)$ of Optimal
首次提交 2026-11-08 07:33
版本更新 2026-11-08 07:33
雷达观测 2026-11-10 12:16
摘要
We design optimized algorithms to solve the Rubik's Cube within moves. This upper bound is asymptotically within a factor of of the known lower bound, which applies to almost all instances. The constant is also the first explicit constant factor for the known upper bound of , where the implicit constant of the previous algorithm was (ten duodecillion). Thus we improve the upper-bound constant by a factor of more than (330 undecillion). Our algorithm runs in time linear in the input size , and uses extra space (beyond the state of the cube). Our implementation is the first practical cube solver to generate solutions of length . Our latest solver outperforms existing solvers for as small as .
作者备注:41 pages, 18 figures, 16 tables. Project page: https://largecubebench.org
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-08 07:33 · 最新观测版本
Solving Large Rubik's Cubes within a Factor of $2.37+o(1)$ of Optimal
We design optimized algorithms to solve the Rubik's Cube within moves. This upper bound is asymptotically within a factor of of the known lower bound, which applies to almost all instances. The constant is also the first explicit constant factor for the known upper bound of , where the implicit constant of the previous algorithm was (ten duodecillion). Thus we improve the upper-bound constant by a factor of more than (330 undecillion). Our algorithm runs in time linear in the input size , and uses extra space (beyond the state of the cube). Our implementation is the first practical cube solver to generate solutions of length . Our latest solver outperforms existing solvers for as small as .
查看此版本解读 →查看此版本原文 ↗