Towers of Hanoi and Analysis of Algorithms
From MaRDI portal
Publication:3718506
DOI10.2307/2322448zbMath0589.90086OpenAlexW4236343746MaRDI QIDQ3718506
Publication date: 1985
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2322448
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Mathematical programming (90C99)
Related Items
On a question of Leiss regarding the Hanoi Tower problem, An iterative algorithm for the Tower of Hanoi with four pegs, Tours de Hanoï et automates, A statistical analysis of the towers of hanoi problem, New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces, Parallelism for multipeg towers of Hanoi, Word calculus in the fundamental group of the Menger curve