The multiway trees of hanoi†

DOI10.1080/00207168308803380MaRDI QIDQ3335009zbMATHOpenAlexFDO

Authors Helmut Jürgensen, D. Wood

Publication date 1983

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

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

zbMATH Keywords

towers of Hanoirecursive solution algorithmcomplete trees

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5485303
• scientific article; zbMATH DE number 1087226
• The Generalized Towers of Hanoi Problem
• Towers of hanoi problem with arbitraryk≧3 pages
• scientific article; zbMATH DE number 4008422

Cites work

• scientific article; zbMATH DE number 3584897 (Why is no real title available?)
• A family of rules for recursion removal
• The Towers of Hanoi Problem

Cited in

(4)

• Algorithm and time complexity analysis of six-pole Hanoi tower problem
• Hanoi revisited
• An optimal algorithm for Reve's puzzle
• A loopless approach to the multipeg towers of hanoi

This page was built for publication: The multiway trees of hanoi^†

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335009)