Discussion and correspondence: A note on the Towers of Hanoi problem

DOI10.1093/COMJNL/20.3.282MaRDI QIDQ4136542zbMATH OpenOpenAlexFDO

Authors Patrick J. Hayes

Publication date 1977

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(38)

• A loopless approach for constructing a fastest algorithm for the towers of hanoi problem
• Some representational issues in default reasoning
• An optimal algorithm to implement the Hanoi towers with parallel moves
• Parallelism for multipeg towers of Hanoi
• Towers of hanoi problem with arbitraryk≧3 pages
• An analysis of the generalized Towers of Hanoi problem
• A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle
• A generalization of the cyclic towers of hanoi: an iterative solution
• A Minimal Space Algorithm for Solving the Towers of Hanoi Problem
• The Generalized Towers of Hanoi Problem
• scientific article; zbMATH DE number 7453187 (Why is no real title available?)
• A general algorithm for finding a shortest path between two n- configurations
• Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
• An iterative solution to the generalized Towers of Hanoi problem
• Towers of hanoi graphs
• A logic for default reasoning
• Planning for conjunctive goals
• The cyclic towers of Hanoi
• Derivation of efficient programs for computing sequences of actions
• The towers of Hanoi problem with parallel moves
• The Towers of Hanoi and Binary Numerals
• The Cyclic Towers of Hanoi and Pseudo Ternary Codes
• Default reasoning in semantic networks: A formalization of recognition and inheritance
• A note on parallelism for the towers of Hanoi
• A statistical analysis of the towers of hanoi problem
• An iterative algorithm for the cyclic Towers of Hanoi problem
• The Towers of Hanoi Problem
• The Colour Towers of Hanoi – An Iterative Solution
• Tours de Hanoï et automates
• A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc
• The towers of Hanoi revisited: Moving the rings by counting the moves
• Pour en finir avec la dérécursivation du problème des tours de Hanoï
• Generalized sequencing problem “Towers of Hanoi”
• Towers of Hanoi problems: deriving iterative solutions by program transformations
• The towers of Hanoi problem with cyclic parallel moves
• Recursive information transducers: Computation models
• Iteration strikes back - at the cyclic Towers of Hanoi
• A loopless approach to the multipeg towers of hanoi

This page was built for publication: Discussion and correspondence: A note on the Towers of Hanoi problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136542)