我记得目前学术界的结论是有上界，但是准确值是不知道的。
by Rubidium_Chloride @ 2022-06-22 17:37:52
草这第一篇题解是直接复制网上的吧
by 听取MLE声一片 @ 2022-06-22 17:38:34
>注意: 仅适用于n较小的时候
by 听取MLE声一片 @ 2022-06-22 17:39:40
@[Reality_Creator](/user/278629)
[oeis](http://oeis.org/A007664) 上好像有题解的做法 , 不过我没找到规律证明 .
by zero4338 @ 2022-06-22 17:42:12
OEIS 上是一个根据固定策略算出来的答案
by dead_X @ 2022-06-22 17:43:15
@[zero4338](/user/174469) 这个 oeis 确实有，但是也确实是个 Open Problem 吧……
by Rubidium_Chloride @ 2022-06-22 17:43:41
https://arxiv.org/pdf/1508.04272.pdf
by impuk @ 2022-06-22 18:02:28
This leads to the given recursive formula a(n) = min{...}. It follows that the sequence of first differences is A137688 = (1,2,2,4,4,4,...) = 2^A003056(n), which in turn gives the explicit formulas for a(n) as partial sums of A137688.
The Frame-Stewart algorithm indeed gives the optimal solution, i.e., the minimal possible number of moves for the case of four pegs [Bousch, 2014].
看起来是对的
by dottle @ 2022-06-22 18:51:07
``````
by lixinling3698 @ 2023-08-22 14:38:35