65
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

A recursive algorithm for the multi-peg tower of hanoi problem

, , &
Pages 67-73 | Received 22 Jun 1994, Published online: 19 Mar 2007
 

Abstract

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⩾5.

C.R. Categories:

AMS (1991) Subject Classification:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.