Towers of Hanoi Solver
This Java program demonstrates solutions for the famous Towers of Hanoi puzzle. I wrote it for my Data Structures and Software Design (CSCI 235) course.
The goal of the Towers of Hanoi puzzle is to move all the discs from the left peg to the right peg. You can only move one disc at a time, and you cannot place a disc on top of a smaller disc.
NOTE: This Java applet doesn’t actually let you play the Towers of Hanoi, it just solves it for you.
My math teacher in high school had the towers of hanoi and I could never figure out the ones above 6 rings.