Skip to content

Little Hanoi Tower game which solves it itself. Sorry for the animation, it is very ugly but... whatever... I suck at it howerver, if you have better animation idea do not hesitate to make a push request !

License

Notifications You must be signed in to change notification settings

Maclow42/HanoiTower

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Tower of Hanoi

Overview

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:

  1. Only one disk can be moved at a time.
  2. 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.
  3. No disk may be placed on top of a smaller disk.

Demo

Visit Tower of Hanoi Solver to see the automated solver in action.

Features

  • Automated solution generation.
  • Interactive visualization of each step.
  • Responsive design for optimal user experience.

Technologies Used

  • HTML
  • CSS
  • JavaScript

Usage

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.

License

This project is licensed under the MIT License - see the LICENSE file for details.

About

Little Hanoi Tower game which solves it itself. Sorry for the animation, it is very ugly but... whatever... I suck at it howerver, if you have better animation idea do not hesitate to make a push request !

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages