A recursive algorithm for the multi-peg tower of Hanoi problem. (English) Zbl 0845.90125
Summary: This paper gives a recursive algorithm to solve the multi-peg tower of Hanoi problem. The algorithm is based on the dynamic programming equation satisfied by the optimal value function, \(M(n, p)\), where \(M(n, p)\) denotes the minimum number of moves required to solve the problem with \(n\) discs and \(p\) pegs. This algorithm is the only one available, particularly for the case when \(p\geq 5\).
MSC:
| 90C39 | Dynamic programming |
References:
| [1] | Aho A. V., Data Structures and Algorithms (1983) · Zbl 0487.68005 |
| [2] | Chu I-Ping., SIGCSE Bulletin 23 (3) pp 2– (1991) · doi:10.1145/126459.126460 |
| [3] | Frame J. S., Amer. Math. Monthly 48 (3) pp 216– (1941) · doi:10.2307/2304268 |
| [4] | Hinz A. M., Computing 42 (3) pp 135– (1989) |
| [5] | Van De Liefvoort A., The Computer J. 35 (1) pp 91– (1992) · doi:10.1093/comjnl/35.1.91 |
| [6] | Lu Xue-Miao., The Computer J. 35 (2) pp 187– (1989) |
| [7] | Reingold E. M., Data Structures (1983) |
| [8] | Wood D., J. Recreational Math. 14 (1) pp 17– (1981) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
