A statistical analysis of the towers of hanoi problem

DOI10.1080/00207168908803728zbMath0664.05007OpenAlexW2041261998WikidataQ56093522 ScholiaQ56093522MaRDI QIDQ3815308

Tat-Hung Chan

Publication date: 1989

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

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

zbMATH Keywords

Hanoi graphsTowers of Hanoi problem

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Related Items

Four encounters with Sierpiński's gasket, The complexity of an optimal algorithm for the generalized tower of hanoi problem, Coloring Hanoi and Sierpiński graphs, Coloring the square of Sierpiński graphs, Shortest paths between regular states of the Tower of Hanoi, The linear \(t\)-colorings of Sierpiński-like graphs, Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence, The \((d, 1)\)-total labelling of Sierpiński-like graphs, Shortest paths in Sierpiński graphs, Parallelism for multipeg towers of Hanoi, The average distance on the Sierpiński gasket

Cites Work

• Analysis of a data matrix and a graph: metagenomic data and the phylogenetic tree
• A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle
• The Towers of Hanoi Problem
• The cyclic towers of Hanoi
• The towers of Hanoi revisited: Moving the rings by counting the moves
• Iteration strikes back - at the cyclic Towers of Hanoi
• The Cyclic Towers of Hanoi: A Representation Approach
• The Generalized Colour Towers of Hanoi: An Iterative Algorithm
• Adjudicating a towers of hanoi contest†
• Towers of Hanoi and Analysis of Algorithms
• A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
• Towers of hanoi graphs
• Counter examples to adjudicating a towers of hanoi contest
• A Representation Approach to the Tower of Hanoi Problem
• Discussion and correspondence: A note on the Towers of Hanoi problem