Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An iterative optimal algorithm for the generalized tower of hanoi problem

From MaRDI portal
Publication:3348426
Jump to:navigation, search

DOI10.1080/00207169108803989zbMath0726.68049OpenAlexW1985149038MaRDI QIDQ3348426

A. J. van Zanten

Publication date: 1991

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

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


zbMATH Keywords

iterative solutionTower of Hanoi problem


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)


Related Items (1)

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




Cites Work

  • The complexity of an optimal algorithm for the generalized tower of hanoi problem




This page was built for publication: An iterative optimal algorithm for the generalized tower of hanoi problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3348426&oldid=16600053"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 14:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki