An Algorithmic Solution to the Multi-tower Hanoi Problem

DOI10.1080/02522667.1987.10698877MaRDI QIDQ3029013zbMATH OpenOpenAlexFDO

Authors M. C. Er

Publication date 1987

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

zbMATH Keywords

algorithmrecreational mathematicstowers of Hanoi problemmulti-tower Hanoi problem

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Recommendations

• The Generalized Towers of Hanoi Problem
• A recursive algorithm for the multi-peg tower of hanoi problem
• An iterative optimal algorithm for the generalized tower of hanoi problem
• scientific article; zbMATH DE number 5485303
• On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem

Cites work

• A Representation Approach to the Tower of Hanoi Problem

Cited in

(13)

• On uniqueness of solution to the multi-peg towers of hanoi
• A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc
• Short Notes: A Fast Algorithm for the Towers of Hanoi Problem
• Preliminary exploration of the 4-peg Hanoi tower
• On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem
• Exact closed form algorithm for the four peg Tower of Hanoi puzzle
• Computational solution of an old tower of Hanoi problem
• A Minimal Space Algorithm for Solving the Towers of Hanoi Problem
• The Solution to a Hanoi-ing Little Problem
• scientific article; zbMATH DE number 5485303 (Why is no real title available?)
• Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach
• A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
• Comparison of two generalized methods for solving multi-peg towers of Hanoi puzzles

This page was built for publication: An Algorithmic Solution to the Multi-tower Hanoi Problem

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