Title
Tower of Hanoi in Different Connectivities
Department, Center, or Institute
Mathematics
Presentation Format
Poster
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.
Session Number
5
Start Date and Time
4-9-2019 4:00 PM
Location
PAC Gym
Recommended Citation
Zou, Luyang, "Tower of Hanoi in Different Connectivities" (2019). Furman Engaged!. 516.
https://scholarexchange.furman.edu/furmanengaged/2019/all/516
Tower of Hanoi in Different Connectivities
PAC Gym
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.