2016 - 19th Annual Steven Galovich Memorial Student Symposium

Presentation Title

Tower of Hanoi

Location

Mohr Walkway

Abstract

The Tower of Hanoi is a famous mathematical puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top. The goal is to move them all to one rod under the rule that a bigger disk cannot be on top of a smaller piece and each move consists of moving exactly one disk to a different rod. In this poster, we describe the puzzle in more detail and the solution of the puzzle, which demonstrates the important mathematical concept of recursion. Generalizations and related applications are also considered.

Presentation Type

Poster

Start Date

4-5-2016 10:30 AM

End Date

4-5-2016 11:45 AM

Panel

Poster Session

Panel Moderator

Karen Kirk

Field of Study for Presentation

Mathematics

No downloadable materials are available for this event.

Share

Import Event to Google Calendar

COinS
 
Apr 5th, 10:30 AM Apr 5th, 11:45 AM

Tower of Hanoi

Mohr Walkway

The Tower of Hanoi is a famous mathematical puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top. The goal is to move them all to one rod under the rule that a bigger disk cannot be on top of a smaller piece and each move consists of moving exactly one disk to a different rod. In this poster, we describe the puzzle in more detail and the solution of the puzzle, which demonstrates the important mathematical concept of recursion. Generalizations and related applications are also considered.