This project is about creating a program that automatically solves the Tower of Hanoi puzzle for 1 to 6 discs. I also made a finite state machine (NFA) diagram to model how the solution works. Using an iterative approach helped me clearly visualize the steps and state changes in the puzzle. This method provides a simple, step-by-step view of how the puzzle is solved, combining problem-solving with automata theory.

REFACTORED BASE ON: https://github.com/AdsonRamos/hanoi

ITERATIVE LOGIC BASE ON: https://www.youtube.com/watch?v=XSz3Woir3sY

ITERATIVE LOGIC BASE ON: https://www.youtube.com/watch?v=cZDydAdFrqg

python -m http.server 8000