This is a Python implementation of the classic Tower of Hanoi puzzle game. The objective of the game is to move all the disks from the leftmost peg to the rightmost peg, following these rules:
- Only one disk can be moved at a time.
- Each move consists of taking the top disk from one stack and placing it onto another stack.
- No disk may be placed on top of a smaller disk.
-
Clone the repository to your local machine using the following command: git clone https://github.com/aleenababy/Hanoi-game.git
-
Navigate to the project directory: cd Hanoi-game
-
Run the game using Python: python hanoi_game.py
-
Follow the prompts to input the number of disks you want to play with and start the game.
- Interactive command-line interface (CLI) for playing the game.
- Recursive algorithm implementation for solving the Tower of Hanoi puzzle efficiently.
This project is licensed under the MIT License.
Contributions are welcome! Feel free to open an issue or submit a pull request.
- Inspired by the classic Tower of Hanoi puzzle.
- Special thanks to Python.org for the Python programming language.
For questions or inquiries, please contact aleenababy.