Description

Towers of Hanoi is an algorithm that solves a mathematical puzzle involving recursion.

The thrust of the problem/project is to move a stack of size-descending disks from one of three rods, rod A, over to Rod C.

• You can only move one disk at a time, starting with the top (smallest) disk on the stack.
• All disks must be moved to Rod C and stacked with smallest disk on top descending to largest disk on bottom.
• The difficulty is that you cannot, in the process, stack a larger disk on top of a smaller disk.
• And you want to be efficient, executing the fewest moves possible.
• This problem is completed in Python but can be done in JavaScript, Ruby, C++, etc...

Table of Contents

• README.md
• resources
• LICENSE
• gitignore

General Information

• This project uses python3 to explain the logic of the game Towers of Hanoi
• The README.md includes an image of the game
• The README.md utilized the Markdown language syntax
• This project included the use of git commands

Technologies

• This Project is created with/by:
• python3
• Utilizing Markdown language for the README.md content
• Visual Studio Code
• Using git commands in bash shell (zsh) terminal and GitHub
• Gemini
• Google