A Representation Approach to the Tower of Hanoi Problem

DOI10.1093/comjnl/25.4.442zbMath0493.90100OpenAlexW2015434816MaRDI QIDQ3956779

M. C. Er

Publication date: 1982

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/25.4.442

zbMATH Keywords

Gray codestower of Hanoi algorithmrepresentation approachbit-string representation

Mathematics Subject Classification ID

Game theory (91A99) Enumerative combinatorics (05A99) Applications of computability and recursion theory (03D80) General topics in the theory of software (68N01)

Related Items (19)

The Towers of Hanoi and Binary Numerals ⋮ A note on parallelism for the towers of Hanoi ⋮ A general algorithm for finding a shortest path between two n- configurations ⋮ An optimal algorithm for Reve's puzzle ⋮ The Cyclic Towers of Hanoi and Pseudo Ternary Codes ⋮ A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc ⋮ Tours de Hanoï et automates ⋮ Pour en finir avec la dérécursivation du problème des tours de Hanoï ⋮ An iterative algorithm for the cyclic Towers of Hanoi problem ⋮ Counter examples to adjudicating a towers of hanoi contest ⋮ A statistical analysis of the towers of hanoi problem ⋮ An Algorithmic Solution to the Multi-tower Hanoi Problem ⋮ The Colour Towers of Hanoi – An Iterative Solution ⋮ A Minimal Space Algorithm for Solving the Towers of Hanoi Problem ⋮ Parallelism for multipeg towers of Hanoi ⋮ Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach ⋮ An iterative solution to the generalized Towers of Hanoi problem ⋮ An analysis of the generalized Towers of Hanoi problem ⋮ Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem

This page was built for publication: A Representation Approach to the Tower of Hanoi Problem