This project is an automated solution for the classic Tower of Hanoi puzzle implemented using HTML, CSS, and JavaScript. The Tower of Hanoi is a mathematical puzzle that involves three rods and a varying number of disks of different sizes. The goal is to move the entire stack of disks from one rod to another, adhering to the following 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.
Visit Tower of Hanoi Solver to see the automated solver in action.
- Automated solution generation.
- Interactive visualization of each step.
- Responsive design for optimal user experience.
- HTML
- CSS
- JavaScript
Simply open the index.html file in your web browser, and the automated solver will take care of solving the Tower of Hanoi puzzle for you.
This project is licensed under the MIT License - see the LICENSE file for details.