Simple Variations on The Tower of Hanoi A Study of Recurrences and Proofs by Induction
The Tower of Hanoi problem was formulated in 1883 by mathematician Edouard Lucas. For over a century, this problem has become familiar to many of us in disciplines such as computer programming, algorithms, and discrete mathematics. Several variations to Lucas' original problem exist today, and...
Saved in:
| Published in: | Teaching Mathematics and Computer Science Vol. 17; no. 2; pp. 131 - 158 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Debrecen
University of Debrecen
24.03.2020
|
| Subjects: | |
| ISSN: | 1589-7389, 2676-8364 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!