Tower of Hanoi is a classical tutorial example traditionally for introducing recursive algorithms in CS1. This poster describes a lecture of teaching graph algorithms using the graphical representation of the game and its variants in upper-level courses. More specifically, this poster provides a totally different perspective on solving the tower of Hanoi using DFS, BFS, A*, greedy, and other search algorithms on graphs. Students will not only solve the game and its variants in an inspiring way, but also learn a modeling method to convert problems into graphs.
Zhen Wu Computer Science Department, University of Pittsburgh, Amanda Buddemeyer Learning Research & Development Center and School of Computing and Information, University of Pittsburgh, Erin Walker University of Pittsburgh, Angela Stewart Computer Science Department, University of Pittsburgh
Xiaoxue Du MIT Media Lab, Robert Parks Massachusetts Institute of Technology, Selim Tezel Massachusetts Institute of Technology, Jeff Freilich Massachusetts Institute of Technology, Nicole Pang Massachusetts Institute of Technology, Hal Abelson Massachusetts Institute of Technology, Cynthia Breazeal Massachusetts Institute of Technology