Adjudicating a towers of hanoi contest†

DOI10.1080/00207168308803386zbMATH Open0519.68057OpenAlexW2155595309MaRDI QIDQ3668869FDOQ3668869

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/00207168308803386

zbMATH Keywords

optimal algorithmtowers of Hanoiadjudication algorithm

Mathematics Subject Classification ID

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

Cited In (15)

• The complexity of an optimal algorithm for the generalized tower of hanoi problem
• Towers of hanoi problem with arbitraryk≧3 pages
• A loopless approach to the multipeg towers of hanoi
• Shortest paths between regular states of the Tower of Hanoi
• Counter examples to adjudicating a towers of hanoi contest
• The diameter of Hanoi graphs
• A general algorithm for finding a shortest path between two n- configurations
• The number of moves of the largest disc in shortest paths on Hanoi graphs
• Four encounters with Sierpiński's gasket
• Parallelism for multipeg towers of Hanoi
• Random walks on dual Sierpinski gaskets
• A statistical analysis of the towers of hanoi problem
• Two-player tower of Hanoi
• Towers of hanoi graphs
• A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles

This page was built for publication: Adjudicating a towers of hanoi contest†

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