Hanoi Viz

Watch and auto-solve the Tower of Hanoi with animated disks and rods.
Vanilla HTML, CSS, and JavaScript. No build step.

Live Demo  ·  GitHub Pages  ·  Quick Start  ·  Structure  ·  License

Contents

• Overview
• Features
• Quick Start
• Project Structure
• Other experiments
• License
• Course Note

Overview

Hanoi Viz demonstrates the classic recursive puzzle with interactive disks and an auto-solve path. Adjust the puzzle, reset state, and follow moves as the solver runs on the client.

Features

Feature	Description
Interactive rods	Move disks under Tower of Hanoi rules
Auto solve	Animate an optimal recursive solution
Reset	Return to a clean starting stack
Client-only	No server required

Quick Start

git clone https://github.com/cikeyz/hanoi-viz.git
cd hanoi-viz
python -m http.server 8000

Open http://127.0.0.1:8000/

Project Structure

hanoi-viz/
├── index.html
├── game.js
├── styles.css
├── LICENSE
├── README.md
└── .gitignore

Other experiments

Branch	Notes
experiment/post-final-gamejs	Alternate game.js from archive CS6. Not merged into main.

License

MIT. See LICENSE.

Course Note

Built for CMPE 201 (Data Structures and Algorithms), Polytechnic University of the Philippines, under Engr. Julian L. Lorico Jr. Final project case study. Published here as a standalone project.