Hanoi-Tower-Excercise

Move all the disks from the left hand post to the right hand post, only moving the disks one at a time and a bigger disk can never be placed on a smaller disk.

View the Project on GitHub slumpbuster/Hanoi-Tower-Excercise

Hanoi Tower

Description

The Tower of Hanoi was a famous problem posed by a mathematician in 1883, The “puzzle” is to move all the disks from the left hand post to the right hand post, only moving the disks one at a time and a bigger disk can never be placed on a smaller disk. Originally, the example had five disks. The exercise was to change it to be a non-fixed disk limit by adding an input control.

Purpose

This was done as an assignment in the MIT course - Full Stack Development with Mern


Technologies Used


Installation

How to Run


Improvements Made

Roadmap of Future Improvements


Files


Contributing

Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.

License

The MIT License (MIT)


Return to Slumpbuster Portfolio