This Power Point presentation, entitled Towers of Hanoi: Discovering the Invariant, was contributed to MIT BLOSSOMS By Dr. Fakhar Lodhi, Professor at the National University of Computer and Emerging Technologies in Lahore, Pakistan. Watch as slide show.
YouTube: Edouard Lucas' Tower of Hanoi Solved by Mitsubishi RV-1A Robot
This site presents a Mitsubishi RV-1A Robot solving the Towers of Hanoi problem. (a brief segment of this is shown in the BLOSSOMS video lesson)
Wikipedia: Tower of Hanoi
This site is a comprehensive Wikipedia discussion of the Towers of Hanoi problem.
Cut the Knot: Tower of Hanoi
This site, hosted by Cut the Knot, provides an interactive applet game enabling students to solve the Towers of Hanoi problem with a varying numbers of disks, in a fast or slow manner.
SuperKids: Towers of Hanoi
This site, sponsored by Super Kids Educational Resources, provides an interactive game for solving the Towers of Hanoi problem up to 7 disks.
Wolfram MathWorld: Tower of Hanoi
This site, sponsored by Wolfram MathWorld, provides a comprehensive discussion of and numerous references for the Towers of Hanoi problem.
YouTube: Hanoi towers 9 disks 511 moves
This site is a video demonstrating that the Towers of Hanoi problem for 9 disks can be done with a minimum of 511 moves.