Towers of Hanoi problems: deriving iterative solutions by program transformations
From MaRDI portal
Publication:1067772
DOI10.1007/BF01934378zbMath0581.68016OpenAlexW1968637546MaRDI QIDQ1067772
Publication date: 1985
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01934378
Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General topics in the theory of software (68N01)
Related Items
Derivation of efficient programs for computing sequences of actions ⋮ Unnamed Item ⋮ Shortest paths between regular states of the Tower of Hanoi
Cites Work
- An iterative solution to the generalized Towers of Hanoi problem
- The Towers of Hanoi Problem
- The cyclic towers of Hanoi
- Iteration strikes back - at the cyclic Towers of Hanoi
- Characterization of flowchartable recursions
- The Generalized Towers of Hanoi Problem
- A Transformation System for Developing Recursive Programs
- Discussion and correspondence: A note on the Towers of Hanoi problem
