This solves normal Hanoi Tower Problem that asked frequently on classes.
This simple solver uses a very simple algorithm (wihtout recursion) to give a proper solution on solving n poles.
Notice that this only moves all leftmost disks to the rightmost pole.
Also the pole count depend on how many disks the pole have. ex. 3 disks = 3 poles
To use this project, you'll need to have Python installed on your computer. You can download and install Python from the official website.
Once you have Python installed, you can clone this repository to your local machine:
git clone https://github.com/Matthew-Eucaristo/Hanoi-Tower-Solver-py.git
To use this, just navigate to the project directory cd [this project directory] and run the python file
This project was created as a simple school project and is not currently being actively maintained. Contributions are being accepted, but for now reviewed personally. So I am sorry for the delays.
I create this solver for fun only, feel free to use it if you need.
All credit goes to the rightful owners