arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.07501math.CO
收藏

汉诺塔:最优性证明、多 peg 边界与计算前沿

The Tower of Hanoi: Optimality Proofs, Multi-Peg Bounds, and Computational Frontiers

James Cook University Singapore(新加坡詹姆斯库克大学)

Qi Junyi

AI总结:

本文以《澳大利亚数学会通报》编辑标准为动机,通过自相似性、不变量框架等重新审视三 peg 汉诺塔问题,分析四 peg 策略的最优性,发现平衡分割在 n>8 时非最优,并提供引理、图表及参考文献,将开放问题重新定义为启发式鲁棒性测试。

摘要:

汉诺塔仍是递归推理、组合几何与计算验证的一个异常丰富的交汇点。受《澳大利亚数学会通报》编辑标准的启发,我们通过谢尔宾斯基式自相似性重新审视经典三 peg 问题,将斯托克迈耶的唯一性论证纳入现代不变量框架,再通过 Frame-Stewart 策略和布希的最优性证明转向四 peg 问题。本文核心是一个警示性的数据与证明循环:平衡分割 k = floor(n/2) 对 n <= 8 确实最优,但我们的修正表显示,n = 9 时它已超出最优成本 20%,n = 13 时超过 1.5 倍,n = 20 时接近 4 倍。我们补充了子塔独立性引理、n <= 15 的可复现表、三张可发表的 TikZ 图(递归箭头、四 peg 状态图、多 peg 增长曲线),以及包含 30 多个来源的参考文献,突出《通报》和《公报》的贡献。结论部分将开放问题重新定义为启发式的鲁棒性测试,而非不成熟的定理。

英文摘要:

The Tower of Hanoi continues to provide a surprisingly rich meeting point for recursive reasoning, combinatorial geometry, and computational verification. Motivated by the editorial standards of the Bulletin of the Australian Mathematical Society, we revisit the classical three-peg problem through Sierpinski-style self-similarity, bring Stockmeyer's uniqueness argument into a modern invariant-based framework, and then pivot to four pegs via the Frame-Stewart strategy and Bousch's optimality proof. The heart of this note is a cautionary data-and-proof cycle: the balanced split k = floor(n/2) is indeed optimal for n <= 8, but our corrected tables show that it already exceeds the optimal cost by 20% at n = 9, crosses the 1.5 mark at n = 13, and comes close to quadrupling the optimum by n = 20. We complement this diagnosis with a subtower-independence lemma, a reproducible table for n <= 15, three publication-ready TikZ figures (recursion arrow, four-peg state diagram, and multi-peg growth curves), and a bibliography exceeding thirty sources that foreground Bulletin and Gazette contributions. The concluding section reframes the open problems as robustness tests for heuristics rather than premature theorems.

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

↑