https://github.com/taijasi-kaveri/tower-of-hanoi-algo-visualizer
https://github.com/taijasi-kaveri/tower-of-hanoi-algo-visualizer
algorithms-implemented java javafx-gui
Last synced: 8 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/taijasi-kaveri/tower-of-hanoi-algo-visualizer
- Owner: Taijasi-Kaveri
- License: mit
- Created: 2023-03-13T03:30:35.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2023-03-13T03:37:31.000Z (over 2 years ago)
- Last Synced: 2025-03-14T06:12:36.627Z (8 months ago)
- Topics: algorithms-implemented, java, javafx-gui
- Homepage:
- Size: 3.91 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Tower-of-Hanoi-Algo-Visualizer
This is a JavaFX application that visualizes the Tower of Hanoi algorithm. The Tower of Hanoi is a mathematical puzzle that 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 or on an empty rod.
* No disk may be placed on top of a smaller disk.
## Features
* The user can set the number of disks to be used in the puzzle.
* The user can visualize the algorithm in action.
* The user can see the number of moves required to complete the puzzle.