A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc

DOI10.1016/0020-0255(89)90043-1zbMath0666.68034OpenAlexW2064003875MaRDI QIDQ1116691

M. C. Er

Publication date: 1989

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(89)90043-1

zbMATH Keywords

iterative algorithmspace complexityTowers of Hanoi

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cites Work

• 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
• The Generalized Towers of Hanoi Problem
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc