Towers of Hanoi problems: deriving iterative solutions by program transformations (Q1067772)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3930324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towers of Hanoi problems: deriving iterative solutions by program transformations |
scientific article; zbMATH DE number 3930324 |
Statements
Towers of Hanoi problems: deriving iterative solutions by program transformations (English)
0 references
1985
0 references
The author presents the derivation of the iterative solutions for the Towers of Hanoi problems starting from the recursive solutions. Various kinds of problems are considered: the standard one, the clockwise and the anticlockwise one, and the generalized one. The derived algorithms have optimal time x space performances. Their derivation implicitly gives the proof of their correctness.
0 references
recursion
0 references
iteration
0 references
program transformation
0 references
Towers of Hanoi problems
0 references
recursive solutions
0 references
correctness
0 references
0.8410782217979431
0 references
0.8284884691238403
0 references
0.821574866771698
0 references
0.8140096068382263
0 references
0.8109439611434937
0 references
