@@ -0,0 +1,537 @@
+/* In the classic problem of the Towers of Hanoi, you have 3 rods and N disks of different sizes which can slide on to any %0Atower The puzzle starts with disks sorted in ascending order of size from top to bottom (e g , each disk sits on top of an %0Aeven larger one) You have the following constraints:%0A(A) Only one disk can be moved at a time%0A(B) A disk is slid off the top of one rod onto the next rod%0A(C) A disk can only be placed on top of a larger disk%0AWrite a program to move the disks from the first rod to the last using Stacks%0A*/%0A

Create Hanoi.java