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

DOI10.1080/00207169508804412zbMath0845.90125OpenAlexW1985427527MaRDI QIDQ4876365

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

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

recurrence relationsmulti-peg tower of Hanoi problemminimum partition numbers

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (1)

On uniqueness of solution to the multi-peg towers of hanoi

Cites Work

• Unnamed Item

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