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
4
Eh, if you want to change it back just edit it, change to your version, and save it over -- Just you did not have your stuff in an execute method and were calling the write from within the algorithm. For more flexibility format text outside algorithm and just return the necessary data (disk-pin pair array or something). Same recursive logic kept.
Hello bh3! I fixed the interpreter and now it replaces new lines (\n) with HTML br-tag. Thanks!
bh3, I deleted your duplicate submissions. I hope it's okay with you. This is just for the sake of reducing redundancy. You can always overwrite your recent submissions rather than creating a new version.
Oh alright, sorry didn't know I could overwrite versions, was myself a little concerned with polluting the versions thing a bit with the combination of me seeing if the issue with the new lines was on my side of the coding and a few mistakes. Thanks.
login to leave a comment
Version 7
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
Note: Algorithmatic only displays single line outputs in regular view :-(
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
Note: Algorithmatic only displays single line outputs in regular view :-(
By bh3
30 months and one week ago
|
|
