Adjudicating a towers of hanoi contest†
From MaRDI portal
Publication:3668869
DOI10.1080/00207168308803386zbMath0519.68057MaRDI QIDQ3668869
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
68Q25: Analysis of algorithms and problem complexity
68R99: Discrete mathematics in relation to computer science
Related Items
Random walks on dual Sierpinski gaskets, The number of moves of the largest disc in shortest paths on Hanoi graphs, A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles, The diameter of Hanoi graphs, A general algorithm for finding a shortest path between two n- configurations, Shortest paths between regular states of the Tower of Hanoi, Four encounters with Sierpiński's gasket, Two-player tower of Hanoi, Parallelism for multipeg towers of Hanoi, The complexity of an optimal algorithm for the generalized tower of hanoi problem, Towers of hanoi graphs, Counter examples to adjudicating a towers of hanoi contest, Towers of hanoi problem with arbitraryk≧3 pages, A statistical analysis of the towers of hanoi problem, A loopless approach to the multipeg towers of hanoi
