跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

We design optimized algorithms to solve the n×n×nn \times n \times n Rubik's Cube within 30.5n2/lg⁡n+o(n2/lg⁡n)30.5 n^2 / \lg n + o(n^2 / \lg n) moves. This upper bound is asymptotically within a factor of 2.372.37 of the known lower bound, which applies to almost all instances. The constant 30.530.5 is also the first explicit constant factor for the known upper bound of O(n2/lg⁡n)O(n^2 / \lg n), where the implicit constant of the previous algorithm was 1.01⋅10401.01 \cdot 10^{40} (ten duodecillion). Thus we improve the upper-bound constant by a factor of more than 3.30⋅10383.30 \cdot 10^{38} (330 undecillion). Our algorithm runs in time linear in the input size N=Θ(n2)N = Θ(n^2), and uses O(Nlg⁡N)O(\sqrt{N} \lg N) extra space (beyond the state of the cube). Our implementation is the first practical cube solver to generate solutions of length O(n2/lg⁡n)O(n^2/\lg n). Our latest solver outperforms existing solvers for nn as small as 840840.

作者备注:41 pages, 18 figures, 16 tables. Project page: https://largecubebench.org

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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 n×n×nn \times n \times n Rubik's Cube within 30.5n2/lg⁡n+o(n2/lg⁡n)30.5 n^2 / \lg n + o(n^2 / \lg n) moves. This upper bound is asymptotically within a factor of 2.372.37 of the known lower bound, which applies to almost all instances. The constant 30.530.5 is also the first explicit constant factor for the known upper bound of O(n2/lg⁡n)O(n^2 / \lg n), where the implicit constant of the previous algorithm was 1.01⋅10401.01 \cdot 10^{40} (ten duodecillion). Thus we improve the upper-bound constant by a factor of more than 3.30⋅10383.30 \cdot 10^{38} (330 undecillion). Our algorithm runs in time linear in the input size N=Θ(n2)N = Θ(n^2), and uses O(Nlg⁡N)O(\sqrt{N} \lg N) extra space (beyond the state of the cube). Our implementation is the first practical cube solver to generate solutions of length O(n2/lg⁡n)O(n^2/\lg n). Our latest solver outperforms existing solvers for nn as small as 840840.

查看此版本解读 →查看此版本原文 ↗