type in the input above and click 'Execute'
the result will be outputted here
the result will be outputted here
Recursive Tower of Hanoi Solution
Output
Related Algorithms
Discussion
1
What happened here? Seems somebody reposted the old version as a new version, and the old version didn't comply with the specification in both the name of the main method and the use of write statements in the method. Accident?
login to leave a comment
Version 8
The Tower of Hanoi or Towers of Hanoi (also known as The Towers of Brahma) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks neatly stacked in order of size on one rod, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following rules:
* Only one disk may be moved at a time.
* Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod.
* No disk may be placed on top of a smaller disk.
http://en.wikipedia.org/wiki/Tower_of_Hanoi
The objective of the puzzle is to move the entire stack to another rod, obeying the following rules:
* Only one disk may be moved at a time.
* Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod.
* No disk may be placed on top of a smaller disk.
http://en.wikipedia.org/wiki/Tower_of_Hanoi
By sakura
29 months and one week ago
|
|
