Adjudicating a towers of hanoi contest†

DOI10.1080/00207168308803386zbMath0519.68057OpenAlexW2155595309MaRDI QIDQ3668869

Derick 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)

Related Items

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

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