https://github.com/jakenherman/tower-of-hanoi

https://github.com/jakenherman/tower-of-hanoi

Last synced: 25 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/jakenherman/tower-of-hanoi
• Owner: JakenHerman
• Created: 2016-01-15T20:47:51.000Z (almost 9 years ago)
• Default Branch: master
• Last Pushed: 2016-01-18T03:40:46.000Z (almost 9 years ago)
• Last Synced: 2024-05-02T00:21:30.855Z (8 months ago)
• Language: Java
• Size: 2.93 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Tower-of-Hanoi

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.

The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:

Only one disk can be moved at a time.

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.

No disk may be placed on top of a smaller disk.

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.