Title
Tower of Hanoi in Different Connectivities
Department, Center, or Institute
Mathematics
Presentation Format
Department Organized Oral Session
Presentation Type
On-campus research
Description
This summer we explored a specific variation of the Tower of Hanoi puzzle: the disks can only move to an adjacent peg. In this way the game can be simplified to a loosely connected graph. We examined graphs on a single line, having connectivity 2 and bipartite using inductive proof and path-finding programs combined. We came to descriptions of shortest path solutions.
Department Organized Oral Session Title
Mathematics Summer Research Experiences
Moderator/Professor
Liz Bouzarth, Mathematics
Session Number
1
Start Date and Time
4-9-2019 9:45 AM
Location
Riley Hall 107
Recommended Citation
Zou, Luyang, "Tower of Hanoi in Different Connectivities" (2019). Furman Engaged!. 515.
https://scholarexchange.furman.edu/furmanengaged/2019/all/515
Tower of Hanoi in Different Connectivities
Riley Hall 107
This summer we explored a specific variation of the Tower of Hanoi puzzle: the disks can only move to an adjacent peg. In this way the game can be simplified to a loosely connected graph. We examined graphs on a single line, having connectivity 2 and bipartite using inductive proof and path-finding programs combined. We came to descriptions of shortest path solutions.