A Minimal Space Algorithm for Solving the Towers of Hanoi Problem

DOI10.1080/02522667.1988.10698918zbMath0719.68030OpenAlexW1967672599MaRDI QIDQ5751947

M. C. Er

Publication date: 1988

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

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

zbMATH Keywords

Towers of Hanoiminimal space algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Enumerative combinatorics (05A99)

Cites Work

• Unnamed Item
• Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
• The Towers of Hanoi Problem
• The towers of Hanoi revisited: Moving the rings by counting the moves
• A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
• A Representation Approach to the Tower of Hanoi Problem
• Discussion and correspondence: A note on the Towers of Hanoi problem

This page was built for publication: A Minimal Space Algorithm for Solving the Towers of Hanoi Problem