The Many Ways to Explore Mathematics through the
Hanoi Tower Game
Hanoi Tower, Recurrence, Minimum Number of Movements, Order of Movement
of the Discs
The present work shows how to explore several mathematical concepts using the classic
game Towers of Hanoi with 3 pins. We investigate a mathematical formula that expresses
the minimum number of plays necessary to win the game according to the number of
discs, we use recurrences, mathematical modeling and geometric progressions. In addition,
we explore the order of the movements of the disks by means of sequences and binary
numbering. Finally, we aim to offer a material that explores several topics of mathematics
that can be used for primary and higher education teachers.