Abstract
An interpretation of the Towers of Hanoi problem in a declarative language (TK!Solver) is offered as an alternative to procedural treatments using recursive or iterative techniques. The article gives a glimpse at TK!Solver and shows solutions to some of the Tower of Hanoi problems beyond a simple simulation of the disk transfer process.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference5 articles.
1. The towers of Hanoi
2. [
2
] M. Konopasek and S. Jayaraman "The TK!Solver Book: A Guide to Problem Solving in Science Engineering Business and Education" Osborne/MaGraw-Hill (1984). [2] M. Konopasek and S. Jayaraman "The TK!Solver Book: A Guide to Problem Solving in Science Engineering Business and Education" Osborne/MaGraw-Hill (1984).
3. Constraint and declarative languages for engineering applications: The TK!Solver contribution
4. Towers of Hanoi revisited a nonrecursive surprise
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献