Abstract
This pearl aims to demonstrate the ideas of wholemeal and projective programming using the Towers of Hanoi puzzle as a running example. The puzzle has its own beauty, which we hope to expose along the way.
Supplemental Material
- Backhouse, Roland, and Maarten Fokkinga. 2001. The associativity of equivalence and the Towers of Hanoi problem. Information Processing Letters 77:71--76. Google Scholar
Digital Library
- Bird, Richard, and Oege de Moor. 1997. Algebra of Programming. London: Prentice Hall Europe. Google Scholar
Digital Library
- Buneman, Peter, and Leon Levy. 1980. The Towers of Hanoi problem. Information Processing Letters 10(4-5):243--244.Google Scholar
Cross Ref
- Er, M.C. 1983. An analysis of the generalized Towers of Hanoi problem. BIT 23:429--435.Google Scholar
Cross Ref
- Gardner, Martin. 1972. Mathematical games: The curious properties of the Gray code and how it can be used to solve puzzles. Scientific American 227(2):106--109. Reprinted, with Answer, Addendum, and Bibliography, as Chapter 2 of Knotted Doughnuts and Other Mathematical Entertainments, W. H. Freeman and Co., New York, 1986.Google Scholar
Cross Ref
- Hinze, Ralf. 2008. Functional Pearl: Streams and Unique Fixed Points. In Proceedings of the 2008 International Conference on Functional Programming, ed. Peter Thiemann, 189--200. ACM Press. Google Scholar
Digital Library
- Knuth, Donald E. 2005. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations. Addison-Wesley Publishing Company. Google Scholar
Digital Library
- Korittky, Joachim. 1998. Functional METAPOST. Diplomarbeit, Universitat Bonn.Google Scholar
- Stockmeyer, Paul K. 2005. The Tower of Hanoi: A bibliography. Available from http://www.cs.wm.edu/~pkstoc/biblio2.pdf.Google Scholar
Index Terms
Functional pearl: la tour d'Hanoï
Recommendations
Functional pearl: la tour d'Hanoï
ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programmingThis pearl aims to demonstrate the ideas of wholemeal and projective programming using the Towers of Hanoi puzzle as a running example. The puzzle has its own beauty, which we hope to expose along the way.
On the treewidth of Hanoi graphs
Highlights- Analysis of Hanoi graphs, which arise from the classic Tower of Hanoi puzzle.
- ...
AbstractThe objective of the well-known Tower of Hanoi puzzle is to move a set of discs one at a time from one of a set of pegs to another, while keeping the discs sorted on each peg. We propose an adversarial variation in which the first ...
Solving Towers of Hanoi and Related Puzzles
Revised Selected Papers of the 14th International Conference on Computer Aided Systems Theory - EUROCAST 2013 - Volume 8111Starting with the well-known Towers of Hanoi, we create a new sequence of puzzles which can essentially be solved in the same way. Since graphs and puzzles are intimately connected, we define a sequence of graphs, the iterated complete graphs , for our ...







Comments