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

DOI10.1080/00207169508804412MaRDI QIDQ4876365zbMATH OpenOpenAlexFDO

Authors Mohammad Kaykobad, S. T.-U. Rahman, Rezwan-al Bakhtiar, A. A. K. Majumdar

Publication date 23 June 1996

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169508804412

zbMATH Keywords

minimum partition numbersmulti-peg tower of Hanoi problemrecurrence relations

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• An Algorithmic Solution to the Multi-tower Hanoi Problem
• scientific article; zbMATH DE number 5485303
• Generalized multi-peg tower of hanoi problem
• The generalized_ppeg tower of hanoi problem

Cited in

(8)

• An iterative algorithm for the Tower of Hanoi with four pegs
• Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach
• On uniqueness of solution to the multi-peg towers of hanoi
• An Algorithmic Solution to the Multi-tower Hanoi Problem
• scientific article; zbMATH DE number 5485303 (Why is no real title available?)
• Short Notes: A Fast Algorithm for the Towers of Hanoi Problem
• A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
• scientific article; zbMATH DE number 1380741 (Why is no real title available?)

This page was built for publication: A recursive algorithm for the multi-peg tower of hanoi problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876365)