The multiway trees of hanoi†

DOI10.1080/00207168308803380zbMATH Open0545.68064OpenAlexW2152838219MaRDI QIDQ3335009FDOQ3335009

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

Recommendations

• scientific article
• 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

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)

Cites Work

• Title not available (Why is that?)
• A family of rules for recursion removal
• The Towers of Hanoi Problem

Cited In (4)

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

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)