A loopless approach for constructing a fastest algorithm for the towers of hanoi problem

DOI10.1080/00207168608803530zbMath0655.68094OpenAlexW2149370323MaRDI QIDQ3802653

M. C. Er

Publication date: 1986

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

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

zbMATH Keywords

iterationloopless algorithmTowers of Hanoi

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (4)

A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc ⋮ A statistical analysis of the towers of hanoi problem ⋮ A Minimal Space Algorithm for Solving the Towers of Hanoi Problem ⋮ Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach

Cites Work

• The Towers of Hanoi Problem
• The towers of Hanoi revisited: Moving the rings by counting the moves
• Discussion and correspondence: A note on the Towers of Hanoi problem
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: A loopless approach for constructing a fastest algorithm for the towers of hanoi problem