This repository contains a Tower of Hanoi problem solver, implemented in JavaScript, tailored for academic or educational purposes at a university level. The project demonstrates an algorithmic approach to solving the classic Tower of Hanoi puzzle efficiently, with clean and modular code.
- Recursive Solution for Tower of Hanoi.
- Configurable number of disks.
- Step-by-step solution visualization.
- Minimal and efficient code design.
hanoi.js- Core logic of the solver.
Feel free to fork and enhance the project by adding visualizations, optimizing the algorithm, or exploring iterative solutions!