Tower Of Hanoi | Code and Explanation Tutorial
- 6 years ago
Donate to my Paypal: \r
If you like the content I produce and want to help me out. I would love your support!\r
YouTube Revenues arent very encouraging. Thank you all you wonderful people!\r
\r
Code: \r
\r
The Tower of Hanoi (also called the Tower of Brahma or Lucas Tower, and sometimes pluralized) 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 in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.\r
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:\r
Only one disk can be moved at a time.\r
Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.\r
No disk may be placed on top of a smaller disk.\r
With three disks, the puzzle can be solved in seven moves. The minimum number of moves required to solve a Tower of Hanoi puzzle is 2n - 1, where n is the number of disks.\r
\r
Follow at:\r
Facebook: facebook.com/GraphoArtyYoutube\r
Instagram: @graphoarty\r
Twitter: @graphoarty
If you like the content I produce and want to help me out. I would love your support!\r
YouTube Revenues arent very encouraging. Thank you all you wonderful people!\r
\r
Code: \r
\r
The Tower of Hanoi (also called the Tower of Brahma or Lucas Tower, and sometimes pluralized) 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 in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.\r
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:\r
Only one disk can be moved at a time.\r
Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.\r
No disk may be placed on top of a smaller disk.\r
With three disks, the puzzle can be solved in seven moves. The minimum number of moves required to solve a Tower of Hanoi puzzle is 2n - 1, where n is the number of disks.\r
\r
Follow at:\r
Facebook: facebook.com/GraphoArtyYoutube\r
Instagram: @graphoarty\r
Twitter: @graphoarty