https://github.com/jerone/towerofhanoi

TowerOfHanoi
https://github.com/jerone/towerofhanoi

Last synced: 9 months ago
JSON representation

TowerOfHanoi

• Host: GitHub
• URL: https://github.com/jerone/towerofhanoi
• Owner: jerone
• License: mit
• Created: 2015-02-15T16:42:18.000Z (about 11 years ago)
• Default Branch: master
• Last Pushed: 2015-02-15T16:43:02.000Z (about 11 years ago)
• Last Synced: 2025-03-21T20:47:18.469Z (about 1 year ago)
• Language: C#
• Size: 168 KB
• Stars: 0
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

          
# TowerOfHanoi

[The Tower of Hanoi](http://en.wikipedia.org/wiki/Tower_of_Hanoi) 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:

1. Only one disk can be moved at a time.

2. 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.

3. 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.

## Screenshot

![TowerOfHanoi](https://raw.githubusercontent.com/jerone/TowerOfHanoi/master/screenshot.jpg)

## Disclamer

This program was build in ~2010 and I'll probably not update it.