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...
Gespeichert in:
| Veröffentlicht in: | Teaching Mathematics and Computer Science Jg. 17; H. 2; S. 131 - 158 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Debrecen
University of Debrecen
24.03.2020
|
| Schlagworte: | |
| ISSN: | 1589-7389, 2676-8364 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!