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

DOI10.1080/00207169008803905zbMath0701.68052OpenAlexW1985266991MaRDI QIDQ3479521

A. J. van Zanten

Publication date: 1990

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

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

zbMATH Keywords

complexityoptimal algorithmTower 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 (3)

Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence ⋮ An iterative optimal algorithm for the generalized tower of hanoi problem ⋮ Shortest paths in Sierpiński graphs

Cites Work

• An analysis of the generalized Towers of Hanoi problem
• A general algorithm for finding a shortest path between two n- configurations
• Adjudicating a towers of hanoi contest†
• Towers of hanoi graphs
• A statistical analysis of the towers of hanoi problem

This page was built for publication: The complexity of an optimal algorithm for the generalized tower of hanoi problem